Olympiad Maths Prep

Library / /4 of 8

Number theory Difficulty 5.3 AIME, harder Prove it Austria

Determine all integers n2n \ge 2 that have a representation
n=a2+b2, n = a^2 + b^2,
where aa is the smallest divisor of nn different from 11 and bb is an arbitrary divisor of nn.

Solutions — 2

Solution 1

If nn is odd, then both aa and bb are odd and therefore n=a2+b2n = a^2 + b^2 is even, contradiction. Therefore, nn is even and a=2a = 2. This also shows that bb is even. Furthermore, b(nb2)=a2=4b \mid (n - b^2) = a^2 = 4. Thus b{2,4}b \in \{2, 4\}, which results in n=8n = 8 and n=20n = 20, respectively.

Solution 2

If nn is odd, then both aa and bb are odd and therefore n=a2+b2n = a^2 + b^2 is even, contradiction. Therefore, nn is even and a=2a = 2. This also shows that bb is even. Furthermore, b(nb2)=a2=4b \mid (n - b^2) = a^2 = 4. Thus b{2,4}b \in \{2, 4\}, which results in n=8n = 8 and n=20n = 20, respectively. \square

Looking for a route rather than 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.