← RoseCode

ROSECODE 558

Number of solutions to a Diophantine Equation II

C_K_Yang · Math ·

Consider the following Diophantine Equation : x2+y2+z2xyyzzxxyz=0 If x, y, z are all integers, then it is a solution to the Diophantine Equation. For example, x=4, y=6, z=9 is one solution to the above Diophantine Equation: 42+62+924×66×99×4469=0 How many solutions are there to the above Diophantine Equation for 0<xyz1014? What is the sum of all these solutions? Answer format: count,(x+y+z) mod 109

You are given: 12082,178899731 for a threshold of 10000