Maths Olympiad Prep

Library / Shortlist JBMO /18 of 50

Shortlist JBMO, 2009

Number theory Difficulty 5.5 AIME, harder Prove it JBMO

Problem:

Determine all positive integer numbers kk for which the numbers k+9k+9 are perfect squares and the only prime factors of kk are 22 and 33.

Solution

Solution:

We have an integer xx such that
x2=k+9 x^2 = k + 9
where k=2a3bk = 2^a 3^b, a,b≥0a, b \geq 0, a,b∈Na, b \in \mathbb{N}.
Therefore,
(x−3)(x+3)=k. (x-3)(x+3) = k.
If b=0b = 0 then we have k=16k = 16.

If b>0b > 0 then we have 3∣k+93 \mid k + 9. Hence, 3∣x23 \mid x^2 and 9∣k9 \mid k.
Therefore, we have b≥2b \geq 2. Let x=3yx = 3y.
(y−1)(y+1)=2a3b−2 (y-1)(y+1) = 2^a 3^{b-2}
If a=0a = 0 then b=3b = 3 and we have k=27k = 27.

If a≥1a \geq 1, then the numbers y−1y-1 and y+1y+1 are even. Therefore, we have a≥2a \geq 2, and
y−12⋅y+12=2a−23b−2 \frac{y-1}{2} \cdot \frac{y+1}{2} = 2^{a-2} 3^{b-2}
Since the numbers y−12\frac{y-1}{2} and y+12\frac{y+1}{2} are consecutive numbers, these numbers have to be powers of 22 and 33. Let m=a−2m = a-2, n=b−2n = b-2.

- If 2m−3n=12^m - 3^n = 1 then we have m≥nm \geq n. For n=0n = 0 we have m=1m = 1, a=3a = 3, b=2b = 2 and k=72k = 72. For n>0n > 0 using  mod 3\bmod 3 we have that mm is even number. Let m=2tm = 2t. Therefore,
(2t−1)(2t+1)=3n \left(2^t - 1\right)\left(2^t + 1\right) = 3^n
Hence, t=1t = 1, m=2m = 2, n=1n = 1 and a=4a = 4, b=3b = 3, k=432k = 432.

- If 3n−2m=13^n - 2^m = 1, then m>0m > 0. For m=1m = 1 we have n=1n = 1, a=3a = 3, b=3b = 3, k=216k = 216. For m>1m > 1 using  mod 4\bmod 4 we have that nn is even number. Let n=2tn = 2t.
(3t−1)(3t+1)=2m \left(3^t - 1\right)\left(3^t + 1\right) = 2^m
Therefore, t=1t = 1, n=2n = 2, m=3m = 3, a=5a = 5, b=4b = 4, k=2592k = 2592.

Set of solutions: {16,27,72,216,432,2592}\{16, 27, 72, 216, 432, 2592\}.

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.