Maths Olympiad Prep

Library / Saudi Arabian IMO Booklet /12 of 26

Saudi Arabian IMO Booklet

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 b≥2b \ge 2 such that
ap−ap=b2. \frac{a^p - a}{p} = b^2.

Solution

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

Now let p≥3p \ge 3. Since aa and ap−1−1a^{p-1}-1 are coprime and a(ap−1−1)=pb2a(a^{p-1}-1) = pb^2, either aa or ap−1−1a^{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
4p−1−1p=(2p−1−1)(2p−1+1)p \frac{4^{p-1}-1}{p} = \frac{(2^{p-1}-1)(2^{p-1}+1)}{p}
is a square, so either 2p−1−12^{p-1}-1 or 2p−1+12^{p-1}+1 is a square, but the former is 33 (mod 44), so the latter is the square: 2p−1+1=c22^{p-1}+1 = c^2. Then (c+1)(c−1)=2p−1(c+1)(c-1) = 2^{p-1}, so both c−1c-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,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.