Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a system of quadratic equations of two variables to solve in several moduli:

$z_0 \equiv (x+k_0)^2-(x+k_0)y \ (mod\ n_0)$
$z_1 \equiv (x+k_1)^2-(x+k_1)y \ (mod\ n_1)$
a $z_m \equiv (x+k_m)^2-(x+k_m)y \ (mod\ n_m)$

I know the values of all the $z_i$, $k_i$, and $n_i$ $\forall i$, and I wish to solve for $x$ and $y$. All $n$s are co-prime if that helps.

Can I solve a system of equations like this faster than exhaustively searching?

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.