1. The problem statement, all variables and given/known data Find positive numbers n and a1,a2, ... , an such that a1 + ... + an = 1000 and the product a1a2...an is as large as possible. 2. Relevant equations The sequence 2,3,4,5,6,7,8,9... to replace 1000 3. The attempt at a solution The solution is 3^332 + 2^2, however, I want to understand how this solution was reached. The example given gives that sequence above to replace 1000, but I'm at a loss as to how to continue to this answer.