Maths Olympiad Prep

Library / /2 of 5

Number theory Difficulty 5.5 AIME, harder Prove it Italy

Problem:

Determine all values of m,n,pm, n, p such that pn+144=m2p^{n}+144=m^{2}, where mm and nn are positive integers and pp is a prime number.

Solution

Solution:

The possible values of (m,n,p)(m, n, p) are (13,2,5)(13,2,5), (20,8,2)(20,8,2) and (15,4,3)(15,4,3).

We rewrite the equation in the form pn=m2144=(m+12)(m12)p^{n}=m^{2}-144=(m+12)(m-12). Since the only divisors of pnp^{n} are powers of pp, the equation is equivalent to the system
{m+12=pam12=pb \left\{ \begin{array}{l} m+12=p^{a} \\ m-12=p^{b} \end{array} \right.
where aa and bb are natural numbers such that a>b0a>b \geq 0 and a+b=na+b=n. Subtracting the second equation from the first, we obtain
24=pb(pab1). 24=p^{b}\left(p^{a-b}-1\right) .
If b=0b=0, this last equation becomes 24=pa124=p^{a}-1, from which we immediately obtain the solution p=5,n=2,m=13p=5, n=2, m=13.

If instead b>0b>0, since pbp^{b} divides 24=23324=2^{3} \cdot 3, then p=2p=2 or p=3p=3. Moreover, since pp does not divide pab1p^{a-b}-1, pb=8p^{b}=8 or pb=3p^{b}=3. Substituting, we find the other two solutions p=2,n=8,m=20p=2, n=8, m=20 and p=3,n=4,m=15p=3, n=4, m=15.

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 translated into English from it; metadata (topic, difficulty) added by this project.