Maths Olympiad Prep

Library / /3 of 16

Number theory Difficulty 4.9 AIME Prove it Austria

Find all integers n>1n > 1 such that the sum of nn and its second-largest divisor is 2013.

Solution

The second-largest divisor of nn is of the form np\frac{n}{p} where pp is the smallest prime that divides nn.
The given condition gives 2013=n+np=np(p+1)2013 = n + \frac{n}{p} = \frac{n}{p}(p+1). Therefore, p+1p+1 is a divisor of 20132013 and thus odd. So, pp is 22, the only even prime.
The equation now becomes 2013=n232013 = \frac{n}{2} \cdot 3 which gives the unique solution n=1342n = 1342. \square

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.