Mock AIME 4 2006-2007 Problems/Problem 3

Revision as of 22:39, 15 January 2007 by Chess64 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Find the largest prime factor of the smallest positive integer $n$ such that $r_1, r_2, \ldots , r_{2006}$ are distinct integers such that the polynomial $(x-r_{1})(x-r_{2})\cdots (x-r_{2006})$ has exactly $n$ nonzero coefficients.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.