Maths Olympiad Prep

Library / /21 of 61

Number theory Difficulty 5.9 AIME, harder Prove it Belarus

Find the smallest positive integer nn, which has three different proper divisors, the sum of which equals to 10011001.
(A proper divisor of nn is any divisor of nn distinct from 11 and nn.)

Solution

Answer: n=924n = 924.
Let d1<d2<d3d_1 < d_2 < d_3 be the divisors given in the condition, then 1<d1<d2<d3<n1 < d_1 < d_2 < d_3 < n. Since d1d_1, d2d_2 and d3d_3 are divisors of nn, there exist positive integers aa, bb and cc such that d1a=d2b=d3c=nd_1 a = d_2 b = d_3 c = n. It is clear that 1<c<b<a<n1 < c < b < a < n. Hence c2c \ge 2, b3b \ge 3, a4a \ge 4. The equation d1+d2+d3=1001d_1 + d_2 + d_3 = 1001 can be transformed:
1001=na+nb+nc=n(1a+1b+1c)n(14+13+12)=13n12, 1001 = \frac{n}{a} + \frac{n}{b} + \frac{n}{c} = n \left( \frac{1}{a} + \frac{1}{b} + \frac{1}{c} \right) \le n \left( \frac{1}{4} + \frac{1}{3} + \frac{1}{2} \right) = \frac{13n}{12},
so 12100113n12 \cdot 1001 \le 13n, i.e. 1277n12 \cdot 77 \le n, n924n \ge 924. On the other hand, the value n=924n = 924 satisfies the condition of the problem, since the number 924924 has proper divisors 462462, 308308 and 231231 the sum of which 462+308+231462 + 308 + 231 equals to 10011001.

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.