Consider the following transformation:
(ba2+cb2+ac2)−(ca2+bc2+ab2)=abca3c−a3b+b3a−a3b+c3b−b3c
Now we transform only numerator:
a3c−a3b+b3a−a3b+c3b−b3c=(b−a)(ab2+a2b+c2−ca2−abc−cb2)==(b−a)(ab2+a2b+c2−ca2−abc−cb2)=(b−a)(a−c)(b2+ab−c2−ca)==(b−a)(a−c)(b−c)(a+b+c).
Therefore the condition ba2+cb2+ac2=ca2+bc2+ab2 for non-zero numbers a,b,c is equivalent to condition: (b−a)(a−c)(b−c)(a+b+c)=0.
a) Similarly we conduct following transformation:
(ba+cb+ac)−(ca+bc+ab)=abca2c−a2b+b2a−a2b+c2b−b2c=abc(b−a)(c−a)(c−b)=0.
Now, as a counter example let's choose a triple a=1,b=2,c=−3. It satisfies the first equation because a+b+c=0. However, the second equation is not correct:
ba+cb+ac=21−32+13=63−4+18=617,ca+bc+ab=−31+23+12=6−2+9+12=619.
6) From transformations above we conclude that the required triples can be two types
Type 1. Integers a,b,c are pairwise distinct.
Type 2. If at least two integers are equal, for example a=b=c, then second equation is correct, while second is correct only if c=−(a+b).
Now we count the number of such triples. The amount of pairwise different non-zero triples is 4040⋅4039⋅4038. For the Type 2, if a=b=c, then there are 2020 numbers to choose a and then b and c are defined. Therefore, there are 3⋅2020 such triples.