Solution:
Let a+b+c=a2+b2+c2=t. Then t≥0. On the other hand, the Root mean square - Arithmetic mean inequality implies that
3a2+b2+c2≥9(a+b+c)2⟺3t≥t2
Hence t∈{0,1,2,3}. If t=0 or t=3, then a=b=c=0 or a=b=c=1, respectively, and the statement is trivial.
Let t=1. Denote by d the product of the denominators of ∣a∣,∣b∣ and ∣c∣. Then x=ad,y=bd and z=cd are integers for which x+y+z=d and x2+y2+z2=d2. We may assume that z>0. Note that
(x+y+z)2=x2+y2+z2⟺xy+yz+xz=0⟺(x+z)(y+z)=z2.
It follows that x+z=rp2, y+z=rq2 and z=∣r∣pq, where p and q are coprime positive integers, and r is a non-zero integer. Since d=x+y+z=r(p2+q2)−∣r∣pq>0 we get that r>0. Then
a=dx=p2+q2−pqp(p−q),b=dy=p2+q2−pqq(q−p),c=dz=p2+q2−pqpq
and thus abc=(pq−p2−q2)3[pq(p−q)]2.
It remains to show that pq(p−q) and p2+q2−pq are coprime integers. Suppose that s is a prime divisor of pq(p−q) and p2+q2−pq. Let s∣p. Since s∣p2+q2−pq, then s∣q, a contradiction. Analogously, s∤q. Hence s∣p−q. Then s∣(p−q)2−(p2+q2−pq)=pq, which is impossible.
The case t=2 can be reduced to the case t=1 by setting a1=1−a, b1=1−b and c1=1−c. Indeed, it is easy to check that a1+b1+c1=a12+b12+c12=1 and a1b1c1=−abc.