Maths Olympiad Prep

Library / Serbian Mathematical Olympiad /24 of 80

Serbian Mathematical Olympiad

Number theory Difficulty 5.8 AIME, harder Prove it Serbia

Problem:

Find all natural numbers aa and bb such that
a∣b2,b∣a2anda+1∣b2+1. a \mid b^{2}, \quad b \mid a^{2} \quad \text{and} \quad a+1 \mid b^{2}+1.

Solution

Solution:

Let b2=cab^{2}=c a. The conditions of the problem give b2=ca∣a4b^{2}=c a \mid a^{4} and a+1∣ca+1a+1 \mid c a+1, and this is equivalent to
c∣a3anda+1∣c−1. c \mid a^{3} \quad \text{and} \quad a+1 \mid c-1.
Let c=d(a+1)+1, d∈N0c=d(a+1)+1,\ d \in \mathbb{N}_{0}. Since a3≡−1(moda+1)a^{3} \equiv -1 \pmod{a+1}, we have a3c≡−1(moda+1)\frac{a^{3}}{c} \equiv -1 \pmod{a+1}, i.e. a3c=e(a+1)−1\frac{a^{3}}{c}=e(a+1)-1 for some e∈Ne \in \mathbb{N}. It follows that a3=(d(a+1)+1)(e(a+1)−1)a^{3}=(d(a+1)+1)(e(a+1)-1), which after multiplying out and cancelling a+1a+1 becomes a2−a+1=de(a+1)+(e−d)a^{2}-a+1=d e(a+1)+(e-d). From here we have e−d≡a2−a+1≡3(moda+1)e-d \equiv a^{2}-a+1 \equiv 3 \pmod{a+1}, hence
e−d=k(a+1)+3andde=a−2−k(k∈Z). e-d=k(a+1)+3 \quad \text{and} \quad d e=a-2-k \quad (k \in \mathbb{Z}).
We distinguish the following cases:

(1) k∉{−1,0}k \notin\{-1,0\}. In this case (*) implies de<∣e−d∣−1d e<|e-d|-1, which is possible only for d=0d=0. Now c=1c=1 and b2=ab^{2}=a, hence (a,b)=(t2,t)(a, b)=\left(t^{2}, t\right).

(2) k=−1k=-1. From (*) we obtain a=d+1a=d+1. Now c=a2c=a^{2} and b2=a3b^{2}=a^{3}, hence (a,b)=(t2,t3)(a, b)=\left(t^{2}, t^{3}\right).

(3) k=0k=0. From (*) we obtain a=d2+3d+2a=d^{2}+3 d+2. Now c=d(a+1)+1=(d+1)3c=d(a+1)+1=(d+1)^{3} and b2=ca=(d+1)4(d+2)b^{2}=c a=(d+1)^{4}(d+2). It follows that d+2=t2d+2=t^{2} for some t∈Nt \in \mathbb{N}, which gives (a,b)=(t2(t2−1),t(t2−1)2), t≥2(a, b)=\left(t^{2}(t^{2}-1), t(t^{2}-1)^{2}\right),\ t \geq 2.

Answer: These are the pairs (a,b)(a, b) of the form (t2,t), (t2,t3)\left(t^{2}, t\right),\ \left(t^{2}, t^{3}\right) and (t2(t2−1),t(t2−1)2)\left(t^{2}(t^{2}-1), t(t^{2}-1)^{2}\right), where t∈Nt \in \mathbb{N}.

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