Maths Olympiad Prep

Library / /12 of 27

Number theory Difficulty 5.5 AIME, harder Prove it Croatia

Determine all triples (p,m,n)(p, m, n) of positive integers such that pp is a prime number and
pmn3=8. p^m - n^3 = 8.

Solution

By moving n3n^3, we get a sum of cubes on the right-hand side:
pm=n3+8=(n+2)(n22n+4). p^m = n^3 + 8 = (n+2)(n^2 - 2n + 4).
Since pp is prime, each of the factors on the right-hand side must be a power of pp:
n+2=pα,n22n+4=pβ, n + 2 = p^{\alpha}, \quad n^2 - 2n + 4 = p^{\beta},
where α\alpha and β\beta are obviously positive integers.
Note that n22n+4n+2n^2 - 2n + 4 \ge n + 2, since that is equivalent to the claim that n23n+20n^2 - 3n + 2 \ge 0, i.e. (n1)(n2)0(n-1)(n-2) \ge 0, which holds because nn is a positive integer. Therefore, βα\beta \ge \alpha.
We can conclude that pαp^\alpha divides both n+2n+2 and n22n+4n^2 - 2n + 4, so it also divides
n(n+2)(n22n+4)=4n4, n \cdot (n+2) - (n^2 - 2n + 4) = 4n - 4,
and then it also divides 4(n+2)(4n4)=124 \cdot (n+2) - (4n - 4) = 12, so p=2p=2 or p=3p=3.
If p=2p=2, then n+2=pαn+2 = p^\alpha is at most 4, and since n>0n > 0, it follows that n=2n=2, which gives the solution (2,4,2)(2, 4, 2).
If p=3p=3, then n+2=pαn+2 = p^\alpha is 3, so n=1n=1, which gives the second solution (3,2,1)(3, 2, 1).

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.