Daily

Random

Practice set

Baltic Way 2021 · Problem 18

Number Theory

Find all integer triples (a,b,c)(a, b, c) satisfying the equation

5a2+9b2=13c25 a^{2}+9 b^{2}=13 c^{2}
Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Diophantine equations · GCD and LCM · Divisibility and factorization

Solutions

Solution

Observe that (a,b,c)=(0,0,0)(a, b, c) = (0, 0, 0) is a solution. Assume that the equation has a solution (a0,b0,c0)≠(0,0,0)(a_0, b_0, c_0) \neq (0, 0, 0). Let d=gcd⁡(a0,b0,c0)>0d = \gcd(a_0, b_0, c_0) > 0. Let (a,b,c)=(a0/d,b0/d,c0/d)(a, b, c) = (a_0/d, b_0/d, c_0/d). Then gcd⁡(a,b,c)=1\gcd(a, b, c) = 1. From 5a02+9b02=13c025a_0^2 + 9b_0^2 = 13c_0^2 it follows that:

5a2+9b2=5(a0d)2+9(b0d)2=5a02+9b02d2=13c02d2=13(c0d)2=13c25a^2 + 9b^2 = 5 \left(\frac{a_0}{d}\right)^2 + 9 \left(\frac{b_0}{d}\right)^2 = \frac{5a_0^2 + 9b_0^2}{d^2} = \frac{13c_0^2}{d^2} = 13 \left(\frac{c_0}{d}\right)^2 = 13c^2

hence (a,b,c)(a, b, c) is also a solution. As (a0,b0,c0)≠(0,0,0)(a_0, b_0, c_0) \neq (0, 0, 0) it follows that (a,b,c)≠(0,0,0)(a, b, c) \neq (0, 0, 0). Consider the equation modulo 1313. It follows that 5a2+9b2=13c2≡0(mod13)5a^2 + 9b^2 = 13c^2 \equiv 0 \pmod{13}, that is 5a2≡−9b2≡4b2(mod13)5a^2 \equiv -9b^2 \equiv 4b^2 \pmod{13}. Multiplying by 88 gives:

a2≡40a2=8⋅5a2≡8⋅4b2=32b2≡6⋅b2(mod13)a^2 \equiv 40a^2 = 8 \cdot 5a^2 \equiv 8 \cdot 4b^2 = 32b^2 \equiv 6 \cdot b^2 \pmod{13}

If 13∣b13\mid b then 6b2≡6⋅02=0(mod13)6b^2 \equiv 6 \cdot 0^2 = 0 \pmod{13} and therefore a2≡0(mod13)a^2 \equiv 0 \pmod{13}, that is 13∣a213\mid a^2. As 1313 is prime it follows that 13∣a13\mid a. Hence 1313 divides aa and bb. It follows that 132∣5a2+9b2=13c213^2\mid 5a^2 + 9b^2 = 13c^2. Consequently 1313 divides c2c^2. As 1313 is prime, 13∣c13\mid c. This means that 1313 divides a,ba, b and cc contradicting the fact that gcd⁡(a,b,c)=1\gcd(a, b, c) = 1. We conclude that 13∤b13 \nmid b does not hold. As 13∣b13\mid b does not hold and 1313 is a prime it follows that bb and 1313 are relatively prime. Therefore there exists x∈Zx \in \mathbb{Z} such that b⋅x≡1(mod13)b \cdot x \equiv 1 \pmod{13}. Multiplying by x2x^2 gives:

(a⋅x)2=a2⋅x2≡6⋅b2⋅x2=6⋅(b⋅x)2≡6⋅12=6(mod13)(a \cdot x)^2 = a^2 \cdot x^2 \equiv 6 \cdot b^2 \cdot x^2 = 6 \cdot (b \cdot x)^2 \equiv 6 \cdot 1^2 = 6 \pmod{13}

That is y2≡6(mod13)y^2 \equiv 6 \pmod{13} where y=a⋅xy = a \cdot x. As y2≡6(mod13)y^2 \equiv 6 \pmod{13} it follows that yy and 1313 are relatively prime. By Fermat's little theorem it follows that y12≡1(mod13)y^{12} \equiv 1 \pmod{13}. Hence:

1≡y12=(y2)6≡66=(62)3≡(36)3≡103=102⋅10=100⋅10≡9⋅10=90≡12(mod13)\begin{aligned} 1 &\equiv y^{12} = (y^2)^6 \equiv 6^6 = (6^2)^3 \equiv (36)^3 \equiv 10^3 \\ &= 10^2 \cdot 10 = 100 \cdot 10 \equiv 9 \cdot 10 = 90 \equiv 12 \pmod{13} \end{aligned}

but 1≢12(mod13)1 \not\equiv 12 \pmod{13} so we have a contradiction. We conclude that the equation 5a2+9b2=13c25a^2 + 9b^2 = 13c^2 has no solution besides the solution (a,b,c)=(0,0,0)(a, b, c) = (0, 0, 0).

(a,b,c)=(0,0,0)\boxed{(a, b, c) = (0, 0, 0)} is the only integer solution.

Contest context

Results from Baltic Way 2021

12 teams

Mean score
4.5 / 5
Scores of 4 or 5
11 / 12
Estonia
5 / 5

Score distribution

01
10
20
30
41
510
All team scores
TeamScore
St. Petersburg5 / 5
Estonia5 / 5
Germany5 / 5
Latvia5 / 5
Lithuania5 / 5
Poland5 / 5
Denmark4 / 5
Norway5 / 5
Finland5 / 5
Sweden0 / 5
Iceland5 / 5
Ireland5 / 5