AMC 10 · 2013 · #25

Grade 11 algebracounting
complex-numberspolynomial-rootsprime-factorizationcombinations-basic systematic-enumerationcaseworkidentify-subproblems ↑ Prerequisites: complex-numberspolynomial-roots
📏 Long solution 💡 4 insights
Problem
A polynomial has a fixed constant term and all its roots are distinct complex whole numbers. Count the polynomials.

Pick an answer.

(A)
288
(B)
528
(C)
576
(D)
992
(E)
1056
How to solve
Strategy Make a Systematic List

Counting polynomials directly is hopeless because the degree is unbounded. The way in is to re-encode each polynomial as its set of roots, then chop that set into pieces that behave like ordinary positive integers: a lone real root, or a conjugate pair a+bi and a-bi whose product is a²+b². Once every piece carries a whole-number size and the sizes must multiply to 50, the question becomes a finite factoring question. Then a systematic list does the rest: write down the few ways to split 50 into factors, and for each factor write down every real root and every conjugate pair that produces it.

1STEP 1

A polynomial is just its root set

A polynomial here is just its root set.

P(z)=Π_s∈ S(z-s), S={roots of P}, |S|=n
2STEP 2

Conjugate symmetry, and why it is exactly the right condition

Integer coefficients mean conjugate symmetry.

e_k(S)=e_k(S)=e_k(S) → e_k(S)inZ[i]∩R=Z
3STEP 3

Negate every root to kill the sign

Negating every root removes the sign problem.

Π_r∈ Rr=Π_s∈ S(-s)=P(0)=50, R=-S
4STEP 4

Cut R into blocks

The roots group into conjugate blocks.

(a+bi)(a-bi)=a²+b² > 0
5STEP 5

Every block value divides 50, so list all blocks

Every block's value must divide the constant.

M₁=3, M₂=4, M₅=6, M₁₀=6, M₂₅=7, M₅₀=8
6STEP 6

The size-1 blocks: two free, one forced

Two single-root blocks are free.

answer=2²·#{choices of blocks of size > 1 whose sizes multiply to 50}
7STEP 7

Split 50 into sizes and count each split

Splitting the constant gives 132 choices.

8+4 · 7+6 · 6+4C(6, 2)=8+28+36+60=132
8STEP 8

Multiply the free units back in

Multiplying back gives 528, choice (D).

4 · 132=528
Answer
528
Three checks. First, the count must be a multiple of 4, because the root 1 and the pair {i, -i} can always be switched on or off independently; 528 = 4 times 132 passes. Second, run the same recipe on a smaller constant term where the whole answer can be listed by hand. With constant term 2 the only split is the single size 2, giving 2² times M₂ = 4 times 4 = 16, and the sixteen sets are easy to write out: one of the four size-2 blocks (the roots 2 and -2, the pairs {1+i, 1-i} and {-1+i, -1-i}), times the four ways to use 1 and {i, -i}, with -1 forced. With constant term 25 the recipe gives 2² times (M₂₅ + 6 choose 2) = 4 times (7 + 15) = 88, which a direct enumeration confirms. Third, the wrong answer (E) 1056 is exactly 2³ times 132, the slip of treating the root -1 as a free choice instead of a forced one, which is a good sign that 4 times 132 is the intended bookkeeping.
💡Key takeaway

Roots with whole-number parts come in conjugate pairs that multiply to the plain whole number a² + b², so counting these polynomials turns into counting the ways to break 50 into factors and then counting the Gaussian integers behind each factor.

  • A polynomial is just its root set
  • Conjugate symmetry, and why it is exactly the right condition
  • Negate every root to kill the sign
  • Cut R into blocks
  • Every block value divides 50, so list all blocks
  • The size-1 blocks: two free, one forced
  • Split 50 into sizes and count each split
  • Multiply the free units back in