Maths Olympiad Prep

Library / /13 of 27

Number theory Difficulty 8.0 Shortlist Prove it Saudi Arabia

Determine the smallest positive integer aa for which there exist a prime number pp and a positive integer b2b \ge 2 such that
apap=b2. \frac{a^p - a}{p} = b^2.

Solution

If p=2p=2, our equation becomes a(a1)=2b2a(a-1) = 2b^2, whose smallest solution in N\mathbb{N} is a=9a=9.

Now let p3p \ge 3. Since aa and ap11a^{p-1}-1 are coprime and a(ap11)=pb2a(a^{p-1}-1) = pb^2, either aa or ap11a^{p-1}-1 must be a square, and it is obviously not the latter; hence aa is a square. Assume that a=4a=4. Then
4p11p=(2p11)(2p1+1)p \frac{4^{p-1}-1}{p} = \frac{(2^{p-1}-1)(2^{p-1}+1)}{p}
is a square, so either 2p112^{p-1}-1 or 2p1+12^{p-1}+1 is a square, but the former is 33 (mod 44), so the latter is the square: 2p1+1=c22^{p-1}+1 = c^2. Then (c+1)(c1)=2p1(c+1)(c-1) = 2^{p-1}, so both c1c-1 and c+1c+1 are powers of 22 and they must be 22 and 44, but then p=4p=4, a contradiction. In conclusion, a=9a=9 is the answer. \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.