Maths Olympiad Prep

Library / /160 of 520

Number theory Difficulty 5.0 AIME, harder Find the answer

9. Given n(n>1)n(n>1) integers (which can be the same) a1a_{1}, a2,,ana_{2}, \cdots, a_{n} satisfy
a1+a2++an=a1a2an=2007. a_{1}+a_{2}+\cdots+a_{n}=a_{1} a_{2} \cdots a_{n}=2007 .

Then the minimum value of nn is \qquad

A number or a short expression. Spacing and $ signs are ignored.

Solution

9. 5 .

Given a1a2an=2007a_{1} a_{2} \cdots a_{n}=2007, we know that a1,a2,,ana_{1}, a_{2}, \cdots, a_{n} are all odd numbers. Also, a1+a2++an=2007a_{1}+a_{2}+\cdots+a_{n}=2007 is an odd number, so nn is odd.

If n=3n=3, i.e., a1+a2+a3=a1a2a3=2007a_{1}+a_{2}+a_{3}=a_{1} a_{2} a_{3}=2007, without loss of generality, assume a1a2a3a_{1} \geqslant a_{2} \geqslant a_{3}, then
a1a1+a2+a33=669,a2a32007a13 a_{1} \geqslant \frac{a_{1}+a_{2}+a_{3}}{3}=669, a_{2} a_{3} \leqslant \frac{2007}{a_{1}} \leqslant 3 \text {. }

If a1=669a_{1}=669, then a2a3=3a_{2} a_{3}=3. Thus,
a2+a34,a1+a2+a3673669a_{2}+a_{3} \leqslant 4, a_{1}+a_{2}+a_{3} \leqslant 673669, only a1=2007,a2a3=1a_{1}=2007, a_{2} a_{3}=1 and a2+a3a_{2}+a_{3} =0=0, which is impossible.
Therefore, n5n \geqslant 5.
 Also, 2007+1+1+(1)+(1)=2007×1×1×(1)×(1)=2007, \begin{array}{l} \text { Also, } 2007+1+1+(-1)+(-1) \\ =2007 \times 1 \times 1 \times(-1) \times(-1)=2007, \end{array}

Thus, the minimum value of nn is 5.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.