Maths Olympiad Prep

Library / /6 of 39

Number theory Difficulty 5.6 AIME, harder Prove it Croatia

Find all positive integers nn for which there exist positive integers aa and bb such that
(n2+2)a=(2n1)b. (n^2 + 2)^a = (2n - 1)^b.

Solution

Notice that n2+23n^2 + 2 \ge 3, n2+2>2n1n^2 + 2 > 2n - 1 and also that numbers n2+2n^2 + 2 and 2n12n - 1 have the same prime factors.
Let pp be a prime factor of n2+2n^2 + 2 and 2n12n - 1.
pn2+2andp2n1    p(n2+2)+(2n1)=(n+1)2    pn+1. p \mid n^2 + 2 \quad \text{and} \quad p \mid 2n - 1 \implies p \mid (n^2 + 2) + (2n - 1) = (n + 1)^2 \implies p \mid n + 1.
Therefore, p2(n+1)(2n1)=3p \mid 2(n + 1) - (2n - 1) = 3 and we conclude that p=3p = 3.
Hence there are positive integers kk and mm, k>mk > m, such that n2+2=3kn^2 + 2 = 3^k and 2n1=3m2n - 1 = 3^m. We get
43k=4n2+8=(3m+1)2+8=32m+23m+9, 4 \cdot 3^k = 4n^2 + 8 = (3^m + 1)^2 + 8 = 3^{2m} + 2 \cdot 3^m + 9,
from which it follows that 3m3^m divides 9, i.e. m2m \le 2.

We have two possibilities:

1) If m=1m = 1, then 2n1=32n - 1 = 3, and consequently n=2n = 2 and 3k=63^k = 6, which is impossible.

2) If m=2m = 2, then 2n1=92n - 1 = 9, and consequently n=5n = 5 and k=3k = 3.

Therefore, n=5n = 5 is the only positive integer with the given property.

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.