Maths Olympiad Prep

Library / /50 of 120

, 2012

Number theory Difficulty 5.2 AIME, harder Prove it Saudi Arabia

Find all positive integers nn and primes p5p \ge 5 such that
(2p)n+1 (2p)^n + 1
is a perfect cube.

Solution

If (2p)n+1=a3(2p)^n + 1 = a^3, then we have
(2p)n=a31=(a1)(a2+a+1)=(a1)[(a1)2+3(a1)+3]. (2p)^n = a^3 - 1 = (a-1)(a^2+a+1) = (a-1)[(a-1)^2+3(a-1)+3].
Since aa is odd, it follows that a2+a+1a^2+a+1 is also odd, hence 2na12^n \nmid a-1. This means that we have a=2npk+1a = 2^n p^k + 1 for some integer k0k \ge 0.

We obtain
2npn=2npk(22np2k+32npk+3).(1) 2^n p^n = 2^n p^k (2^{2n} p^{2k} + 3 \cdot 2^n p^k + 3). \quad (1)

Case 1. k>0k > 0. Clearly, we have k<nk < n, hence from (1) it follows p22np2k+32npk+3p|2^{2n} p^{2k} + 3 \cdot 2^n p^k + 3. We get p3p|3, not possible since p5p \ge 5.

Case 2. k=0k = 0. From (1) we obtain
pn=4n+32n+3.(2) p^n = 4^n + 3 \cdot 2^n + 3. \quad (2)
For n=1n = 1 we have p=13p = 13.

For n=2n = 2 we have p2=31p^2 = 31, not possible.

For n=3n = 3 we have p3=64+24+3<53p^3 = 64 + 24 + 3 < 5^3, not possible.

For n3n \ge 3 we prove by induction that
5n>4n+32n+3=pn, 5^n > 4^n + 3 \cdot 2^n + 3 = p^n,
and so p<5p < 5, which is not possible.

The unique solutions are n=1,p=13n = 1, p = 13.

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.