Maths Olympiad Prep

Library / /3 of 24

Number theory Difficulty 4.8 AIME Prove it Croatia

Let cc and dd be positive divisors of a positive integer nn. If c>dc > d, prove that
c>d+d2n. c > d + \frac{d^2}{n}.
(Russia 2011)

Solution

Consider nd\frac{n}{d} and nc\frac{n}{c}. These are also positive divisors of nn which satisfy nd>nc\frac{n}{d} > \frac{n}{c}.
We now have
ndnc1, \frac{n}{d} - \frac{n}{c} \ge 1,
from which
cddcn>d2n c - d \ge \frac{dc}{n} > \frac{d^2}{n}
follows.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.