Difference between revisions of "Mock AIME 4 2006-2007 Problems/Problem 3"
m |
|||
| Line 6: | Line 6: | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | ---- | ||
| + | |||
| + | *[[Mock AIME 4 2006-2007 Problems/Problem | Next Problem]] | ||
| + | *[[Mock AIME 4 2006-2007 Problems/Problem | Previous Problem]] | ||
*[[Mock AIME 4 2006-2007 Problems]] | *[[Mock AIME 4 2006-2007 Problems]] | ||
Revision as of 10:46, 16 January 2007
Problem
Find the largest prime factor of the smallest positive integer 
such that 
are distinct integers such that the polynomial 
has exactly nonzero coefficients.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
