ROSECODE 558
Number of solutions to a Diophantine Equation II
Consider the following Diophantine Equation :
If x, y, z are all integers, then it is a solution to the Diophantine Equation.
For example, is one solution to the above Diophantine Equation:
How many solutions are there to the above Diophantine Equation for ? What is the sum of all these solutions?
Answer format: count,( ) mod 109
You are given: 12082,178899731 for a threshold of 10000