Maths Olympiad Prep

Library / International Mathematical Olympiad /14 of 110

International Mathematical Olympiad

Number theory Difficulty 7.8 National Olympiad, round 2 Prove it IMO

Prove that 5n−3n5^{n}-3^{n} is not divisible by 2n+652^{n}+65 for any positive integer nn.

Solutions — 2

Solution 1

Notice that if nn is even, then 3∣m3 \mid m, but 3∤5n−3n3 \nmid 5^{n}-3^{n}, contradiction. So, from now on we assume that nn is odd, n=2k+1n=2k+1. Obviously n=1n=1 is not possible, so n⩾3n \geqslant 3. Notice that mm is coprime to 22, 33 and 55.
Let m1m_1 be the smallest positive multiple of mm that can be written in the form of either ∣5a2−3b2∣|5a^{2}-3b^{2}| or ∣a2−15b2∣|a^{2}-15b^{2}| with some integers aa and bb.
Note that 5n−3n=5(5k)2−3(3k)25^{n}-3^{n}=5(5^{k})^{2}-3(3^{k})^{2} is a multiple of mm, so the set of such multiples is non-empty, and therefore m1m_1 is well-defined.

I. First we show that m1⩽5mm_1 \leqslant 5m. Consider the numbers
5k+1x+3k+1y,0⩽x,y⩽m 5^{k+1}x+3^{k+1}y, \quad 0 \leqslant x, y \leqslant \sqrt{m}
There are ⌊m⌋+1>m\lfloor\sqrt{m}\rfloor+1>\sqrt{m} choices for xx and yy, so there are more than mm possible pairs (x,y)(x, y). Hence, two of these sums are congruent modulo mm: 5k+1x1+3k+1y1≡5k+1x2+3k+1y2(modm)5^{k+1}x_1+3^{k+1}y_1 \equiv 5^{k+1}x_2+3^{k+1}y_2 \pmod{m}.
Now choose a=x1−x2a=x_1-x_2 and b=y1−y2b=y_1-y_2; at least one of a,ba, b is nonzero, and
5k+1a+3k+1b≡0( mod m),∣a∣,∣b∣⩽m 5^{k+1}a+3^{k+1}b \equiv 0 \quad (\bmod m), \quad |a|,|b| \leqslant \sqrt{m}
From
0≡(5k+1a)2−(3k+1b)2=5n+1a2−3n+1b2≡5⋅3na2−3n+1b2=3n(5a2−3b2)(modm) 0 \equiv (5^{k+1}a)^{2}-(3^{k+1}b)^{2}=5^{n+1}a^{2}-3^{n+1}b^{2} \equiv 5 \cdot 3^{n}a^{2}-3^{n+1}b^{2}=3^{n}(5a^{2}-3b^{2}) \pmod{m}
we can see that ∣5a2−3b2∣|5a^{2}-3b^{2}| is a multiple of mm. Since at least one of aa and bb is nonzero, 5a2≠3b25a^{2} \neq 3b^{2}. Hence, by the choice of a,ba, b, we have 0<∣5a2−3b2∣⩽max⁡(5a2,3b2)⩽5m0<|5a^{2}-3b^{2}| \leqslant \max(5a^{2}, 3b^{2}) \leqslant 5m. That shows that m1⩽5mm_1 \leqslant 5m.

II. Next, we show that m1m_1 cannot be divisible by 22, 33 and 55. Since m1m_1 equals either ∣5a2−3b2∣|5a^{2}-3b^{2}| or ∣a2−15b2∣|a^{2}-15b^{2}| with some integers a,ba, b, we have six cases to check. In all six cases, we will get a contradiction by presenting another multiple of mm, smaller than m1m_1.
- If 5∣m15 \mid m_1 and m1=∣5a2−3b2∣m_1=|5a^{2}-3b^{2}|, then 5∣b5 \mid b and ∣a2−15(b5)2∣=m15<m1|a^{2}-15(\frac{b}{5})^{2}|=\frac{m_1}{5}<m_1.
- If 5∣m15 \mid m_1 and m1=∣a2−15b2∣m_1=|a^{2}-15b^{2}|, then 5∣a5 \mid a and ∣5(a5)2−3b2∣=m15<m1|5(\frac{a}{5})^{2}-3b^{2}|=\frac{m_1}{5}<m_1.
- If 3∣m13 \mid m_1 and m1=∣5a2−3b2∣m_1=|5a^{2}-3b^{2}|, then 3∣a3 \mid a and ∣b2−15(a3)2∣=m13<m1|b^{2}-15(\frac{a}{3})^{2}|=\frac{m_1}{3}<m_1.
- If 3∣m13 \mid m_1 and m1=∣a2−15b2∣m_1=|a^{2}-15b^{2}|, then 3∣a3 \mid a and ∣5b2−3(a3)2∣=m13<m1|5b^{2}-3(\frac{a}{3})^{2}|=\frac{m_1}{3}<m_1.
- If 2∣m12 \mid m_1 and m1=∣5a2−3b2∣m_1=|5a^{2}-3b^{2}|, then ∣(5a−3b2)2−15(a−b2)2∣=m12<m1|\left(\frac{5a-3b}{2}\right)^{2}-15\left(\frac{a-b}{2}\right)^{2}|=\frac{m_1}{2}<m_1.
- If 2∣m12 \mid m_1 and m1=∣a2−15b2∣m_1=|a^{2}-15b^{2}|, then ∣5(a−3b2)2−3(a−5b2)2∣=m12<m1|5\left(\frac{a-3b}{2}\right)^{2}-3\left(\frac{a-5b}{2}\right)^{2}|=\frac{m_1}{2}<m_1.
(The last two expressions can be obtained from (5a+3b)(5−3)=(5a−3b)+15(b−a)(\sqrt{5}a+\sqrt{3}b)(\sqrt{5}-\sqrt{3})=(5a-3b)+\sqrt{15}(b-a) and (a+15b)(5−3)=5(a−3b)+3(5b−a)(a+\sqrt{15}b)(\sqrt{5}-\sqrt{3})=\sqrt{5}(a-3b)+\sqrt{3}(5b-a).)
In all six cases, we found that either m12\frac{m_1}{2}, m13\frac{m_1}{3} or m15\frac{m_1}{5} is of the form ∣5x2−3y2∣|5x^{2}-3y^{2}| or ∣x2−15y2∣|x^{2}-15y^{2}|. Since mm is coprime to 22, 33 and 55, the presented number is a multiple of mm, but this contradicts the minimality of m1m_1.

III. The last remaining case is m1=mm_1=m, so either m=∣5a2−3b2∣m=|5a^{2}-3b^{2}| or m=∣a2−15b2∣m=|a^{2}-15b^{2}|. We will get a contradiction by considering the two sides modulo 33, 44 and 55.
- 2n+65=5a2−3b22^{n}+65=5a^{2}-3b^{2} is not possible, because 2n+65≡1(mod3)2^{n}+65 \equiv 1 \pmod{3}, but 5a2−3b2≢1(mod3)5a^{2}-3b^{2} \not\equiv 1 \pmod{3}.
- 2n+65=3b2−5a22^{n}+65=3b^{2}-5a^{2} is not possible, because 2n+65≡1(mod4)2^{n}+65 \equiv 1 \pmod{4}, but 3b2−5a2≢1(mod4)3b^{2}-5a^{2} \not\equiv 1 \pmod{4}.
- 2n+65=a2−15b22^{n}+65=a^{2}-15b^{2} is not possible, because 2n+65≡±2(mod5)2^{n}+65 \equiv \pm 2 \pmod{5}, but a2−15b2≢±2(mod5)a^{2}-15b^{2} \not\equiv \pm 2 \pmod{5}.
- 2n+65=15b2−a22^{n}+65=15b^{2}-a^{2} is not possible, because 2n+65≡1(mod4)2^{n}+65 \equiv 1 \pmod{4}, but 15b2−a2≢1(mod4)15b^{2}-a^{2} \not\equiv 1 \pmod{4}.
We found a contradiction in all cases, that completes the solution.

Solution 2

Suppose again that 5n≡3n(modm=2n+65)5^{n} \equiv 3^{n} \pmod{m=2^{n}+65}. Like in the first solution, we conclude that nn must be odd, and n⩾3n \geqslant 3, so 8∣2n8 \mid 2^{n}.
Using Jacobi symbols,
−1=(2n+655)=(52n+65)=(5n2n+65)=(3n2n+65)=(32n+65)=(2n+653)=1, -1=\left(\frac{2^{n}+65}{5}\right)=\left(\frac{5}{2^{n}+65}\right)=\left(\frac{5^{n}}{2^{n}+65}\right)=\left(\frac{3^{n}}{2^{n}+65}\right)=\left(\frac{3}{2^{n}+65}\right)=\left(\frac{2^{n}+65}{3}\right)=1,
contradiction.

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.