Maths Olympiad Prep

Library / /4 of 39

Algebra Difficulty 5.3 AIME, harder Prove it Romania

Andrei represents 20252025 as a sum of 4040 pairwise different positive integers. Find the lowest value that the largest of the 4040 numbers can achieve.

Solution

Let 0<a1<a2<a3<<a400 < a_1 < a_2 < a_3 < \dots < a_{40} so that a1+a2+a3++a40=2025a_1 + a_2 + a_3 + \dots + a_{40} = 2025. Then a2a1+1a_2 \ge a_1 + 1, a3a2+1a_3 \ge a_2 + 1, a4a3+1a_4 \ge a_3 + 1, \dots, a40a39+1a_{40} \ge a_{39} + 1.
Consequently, a40a1+39a2+38a38+2a_{40} \ge a_1 + 39 \ge a_2 + 38 \ge \dots \ge a_{38} + 2.
Then 40a40(a1+39)+(a2+38)++(a37+3)+(a38+2)+(a39+1)+a4040 \cdot a_{40} \ge (a_1+39)+(a_2+38)+\dots+(a_{37}+3)+(a_{38}+2)+(a_{39}+1)+a_{40},
hence 40a402025+(1+2++39)=280540 \cdot a_{40} \ge 2025 + (1 + 2 + \dots + 39) = 2805. Since a40a_{40} is a positive integer,
it follows that a4071a_{40} \ge 71.
The value a40=71a_{40} = 71 can be achieved: 1+29+34+35+36++70+71=20251+29+34+35+36+\dots+70+71 = 2025,
therefore the required minimum is 7171.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.