A group of people will be partitioned into indistinguishable -person committees. Each committee will have one chairperson and one secretary. The number of different ways to make these assignments can be written as , where and are positive integers and is not divisible by . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Line up the 16 people, cut the line into four groups of 4, and divide out orders that do not matter. Then count the 3s on top and bottom.
Solution
We only need to know how many factors of the count has, so write the count as a product of simple pieces instead of working out the number.
Step 1: a formula for the count.
1. Line up the people in a row. There are ways.
2. Cut the row into four blocks of : people –, –, –, –. In each block, the first person is chairperson, the second is secretary, and the last two are ordinary members.
3. Every lineup gives a valid set of committees, but many lineups give the same one:
- Swapping the two ordinary members in a block changes nothing. That is lineups per block, so in all.
- The committees are indistinguishable, so reordering the four blocks changes nothing. That is lineups.
4. So each set of committees is counted times, and the number of ways is
Step 2: count the factors of .
- On top, . The multiples of are : five of them, each giving one . The number gives one extra. So has factors of .
- On the bottom, has no s, and has one.
- So the count has factors of , and .
The answer is .
Why this works
"Line everyone up, then divide out the orders you do not care about" gives the count as a fraction of factorials and small numbers. That form is exactly what you want when the question asks how many times a prime divides the answer. To count the s in , count the multiples of , then add one more for each multiple of .
Alternative approach
Build the committees directly. Choose people for a first committee, then of the remaining , then of the remaining , and the last are forced. Divide by because the committees have no order. This comes to . Then choose a chair ( ways) and a secretary ( ways) in each committee: more. Count the s: has , has , and has . So .
The trap
Forgetting that the committees are indistinguishable, so you do not divide by 4!, which leaves six 3s and gives choice (B).
Concise solution
Line the people up in a row ( ways) and cut the row into four consecutive blocks of . In each block, call the first person the chairperson and the second the secretary; the last two are ordinary members.
This overcounts. Swapping the two ordinary members within a block changes nothing, a factor of per block, so overall. Reordering the four blocks changes nothing since committees are indistinguishable, a factor of . Every assignment arises from exactly lineups, so the number of assignments is
Now count factors of . In the multiples of contribute and the multiple of contributes one more, for . The denominator has , one factor of , and has none. So
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Algebra, Chapter 11: Special Factorizations
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Set up the equation/formula and compute; no special trick needed