Difference between revisions of "2006 USAMO Problems/Problem 4"

Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 +
Find all positive integers <math>n</math> such that there are <math>k\ge 2</math> positive rational numbers <math>a_1,a_2,\ldots a_k</math> satisfying <math>a_1+a_2+...+a_k=a_1\cdot a_2\cdots a_k=n.</math>
 
== Solution ==
 
== Solution ==
 
== See Also ==
 
== See Also ==
 
*[[2006 USAMO Problems]]
 
*[[2006 USAMO Problems]]

Revision as of 11:04, 12 July 2006

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\cdots a_k=n.$

Solution

See Also

Invalid username
Login to AoPS