Maths Olympiad Prep

Track / Stage 7 / 148 of 300 #2188 of 2604

Problem 2188

National Olympiad second round; IMO P1/P4
Number theory Difficulty 7.5 Prove it Turkey — Team Selection Test · Turkey

Find all pairs of positive odd integers (m,n)(m, n) satisfying n∣3m+1n \mid 3m + 1 and m∣n2+3m \mid n^2 + 3.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Conditions n∣3m+1n \mid 3m + 1 and m∣n2+3m \mid n^2 + 3 we label by (1) and (2).
By (1) 33 and nn are coprime: (3,n)=1(3, n) = 1 (3).
Let n≤9n \le 9. Due to (3) nn can take 1,5,71, 5, 7.
If n=1n = 1 from (2) m∣4m \mid 4 and since mm is odd we get m=1m = 1. (m,n)=(1,1)(m, n) = (1, 1) satisfies the conditions.
If n=5n = 5 (1) and (2) become 5∣3m+15 \mid 3m + 1 and m∣28m \mid 28. Since mm is odd m∣7m \mid 7 but m=1,7m = 1, 7 do not satisfy the condition 5∣3m+15 \mid 3m + 1.
If n=7n = 7 (1) and (2) become 7∣3m+17 \mid 3m + 1 and m∣52m \mid 52. Since mm is odd m∣13m \mid 13 but m=1,13m = 1, 13 do not satisfy the condition 7∣3m+17 \mid 3m + 1.
Now n>9n > 9. By (1) and (2) there are positive integers p,qp, q such that np=3m+1np = 3m + 1 and mq=n2+3mq = n^2 + 3.
Now let us prove that m≥n+1m \ge n + 1. If m≤nm \le n then 4n>3m+14n > 3m + 1. Therefore, pp can be only 1,21, 2 or 33. But if p=3p = 3 then 3∣13 \mid 1 and if p=1p = 1 we get np≡1≢0≡3m+1(mod2)np \equiv 1 \not\equiv 0 \equiv 3m + 1 \pmod{2}. Thus, p=2p = 2.
Now m∣n2+3⇒m∣4n2+12=(2n)2+12=(3m+1)2+12⇒m∣13m \mid n^2 + 3 \Rightarrow m \mid 4n^2 + 12 = (2n)^2 + 12 = (3m+1)^2 + 12 \Rightarrow m \mid 13. Thus, m=1,13m = 1, 13. Since n=3m+12n = \frac{3m+1}{2} if m=1m = 1 then n=2n = 2 and if m=13m = 13 then n=3⋅13+12=20n = \frac{3 \cdot 13 + 1}{2} = 20. In both cases nn is even, contradiction. Thus, we have proved that m≥n+1m \ge n + 1.
Now n(n+1)>n2+3=mq≥(n+1)q⇒q<nn(n+1) > n^2 + 3 = mq \ge (n+1)q \Rightarrow q < n.
From (1) n∣3m+1⇒n∣3mq+q=3(n2+3)+q⇒n∣q+9n \mid 3m+1 \Rightarrow n \mid 3mq + q = 3(n^2+3) + q \Rightarrow n \mid q+9. Thus, n≤q+9n \le q+9.
Now since q<nq < n and 9<n9 < n we get n≤q+9<n+n=2nn \le q+9 < n+n = 2n. Therefore, q+9=nq+9 = n and we get n2+3=mq=m(n−9)n^2+3 = mq = m(n-9).
Then m(n−9)−n2−3=0⇒(m−n−9)(n−9)=84=3⋅4⋅7m(n-9) - n^2 - 3 = 0 \Rightarrow (m-n-9)(n-9) = 84 = 3 \cdot 4 \cdot 7.
Since m−n−9m-n-9 is odd and n−9n-9 is even 4∣n−94 \mid n-9. Since by (1) (n−9,3)=1(n-9, 3) = 1 we get that either m−n−9=3,n−9=4⋅7m-n-9 = 3, n-9 = 4 \cdot 7 or m−n−9=3⋅7,n−9=4m-n-9 = 3 \cdot 7, n-9 = 4.
In the first case (m,n)=(49,37)(m, n) = (49, 37) and in the second case (m,n)=(43,13)(m, n) = (43, 13). These pairs satisfy the conditions.
Thus, there are three solutions: (m,n)=(1,1)(m, n) = (1, 1), (49,37)(49, 37), (43,13)(43, 13).

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.