It's gonna be a good year.

Suppose \(x^2= -y \mod{625}\) has integer solutions for \(x\) where \(y > 0\). Let the sum of all possible \(y \mod{10}\) be \(A\). Let the sum of the first 40 solutions for \(y\) (in order from least to greatest) be \(B\). Let the maximum number of possible solutions of \(x\) for a specified \(y\) be \(C\).

Find \(A+B+C-7\).

×

Problem Loading...

Note Loading...

Set Loading...