2006 USAMO Problems/Problem 4

Revision as of 11:12, 28 January 2008 by 1=2 (talk | contribs) (My solution was wrong wrong wrong, after reading the topic.)

Problem

Find all positive integers $n$ such that there are $k\ge 2$ positive rational numbers $a_1,a_2,\ldots a_k$ satisfying $a_1+a_2+...+a_k = a_1 \cdot a_2 \cdot \cdots a_k = n$.

Solution

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

See Also