Observe that (a,b,c)=(0,0,0) is a solution. Assume that the equation has a solution (a0,b0,c0)=(0,0,0). Let d=gcd(a0,b0,c0)>0. Let (a,b,c)=(a0/d,b0/d,c0/d). Then gcd(a,b,c)=1. From 5a02+9b02=13c02 it follows that:
5a2+9b2=5(da0)2+9(db0)2=d25a02+9b02=d213c02=13(dc0)2=13c2
hence (a,b,c) is also a solution.
As (a0,b0,c0)=(0,0,0) it follows that (a,b,c)=(0,0,0). Consider the equation modulo 13. It follows that 5a2+9b2=13c2≡0(mod13), that is 5a2≡−9b2≡4b2(mod13). Multiplying by 8 gives:
a2≡40a2=8⋅5a2≡8⋅4b2=32b2≡6⋅b2(mod13)
If 13∣b then 6b2≡6⋅02=0(mod13) and therefore a2≡0(mod13), that is 13∣a2. As 13 is prime it follows that 13∣a. Hence 13 divides a and b. It follows that 132∣5a2+9b2=13c2. Consequently 13 divides c2. As 13 is prime, 13∣c. This means that 13 divides a,b and c contradicting the fact that gcd(a,b,c)=1. We conclude that 13∤b does not hold.
As 13∣b does not hold and 13 is a prime it follows that b and 13 are relatively prime. Therefore there exists x∈Z such that b⋅x≡1(mod13). Multiplying by x2 gives:
(a⋅x)2=a2⋅x2≡6⋅b2⋅x2=6⋅(b⋅x)2≡6⋅12=6(mod13)
That is y2≡6(mod13) where y=a⋅x. As y2≡6(mod13) it follows that y and 13 are relatively prime. By Fermat's little theorem it follows that y12≡1(mod13). Hence:
1≡y12=(y2)6≡66=(62)3≡(36)3≡103=102⋅10=100⋅10≡9⋅10=90≡12(mod13)
but 1≡12(mod13) so we have a contradiction. We conclude that the equation 5a2+9b2=13c2 has no solution besides the solution (a,b,c)=(0,0,0).
(a,b,c)=(0,0,0) is the only integer solution.