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

Prove the equation $$x^2+17y^2 \equiv 257 \pmod p$$ has integer solutions modulo $p$ for every prime $p$.

Note: The case $p=2$ is trivial.

If $p$ is odd and $p \nmid 257-17y^2$ I tried to consider quadratic residues $\pmod p$, it's thus equivalent to show $\left(\frac{257-17y^2}{p}\right)=(257-17y^2)^{\frac{p-1}{2}}=1$ for some $y \in \mathbb{Z}_p$.But how to deduce the existence of $y$?

share|cite|improve this question
up vote 2 down vote accepted

Count the number of numbers of the form $257-x^2$ modulo $p$; count the number of numbers of the form $17y^2$ modulo $p$; apply the pigeonhole principle. You may have to make a special case for a prime or two.

share|cite|improve this answer
Got it, thanks! – user31899 Sep 19 '12 at 11:13

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.