← RoseCode

ROSECODE 557

Number of solutions to a Diophantine Equation I

C_K_Yang · Math ·

Consider the following Diophantine Equation : x2−y2−z2−xy−yz−zx=0 We call an integer triple(x,y,z) a primitive solution if it is a solution to the Diophantine Equation with gcd(x,y,z)=1 For example, (3,1,1) is a primitive solution to the above Diophantine Equation: 32−12−12−3×1−1×1−1×3=0 In fact, there are only five primitive solutions for 0<z≤y≤x≤100, namely (3,1,1),(19,11,1),(37,19,5),(61,29,11), and (91,41,19). The sum of these five primitive solutions is 349, i.e. ∑x+y+z How many primitive solutions are there to the above Diophantine Equation for 0<z≤y≤x≤1013? What is the sum of all these primitive solutions? Answer format: count,(∑x+y+z) mod 109

You are given: 479,3971343 for a threshold of 10000