Take the 2-minute tour ×
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.

How might one show that if given that there exist some integer $x_0$ s.t. ${x_0}^2 \equiv c \pmod p$ for some integer $c$ that is not a square and not a multiple of $p$, then there exist $x_n$ s.t. $x_n \equiv x_{n+1} \pmod p$ & $x_{n+1} \equiv c \pmod p^{n+1}$? Thanks in advance.

share|improve this question
Your question is unclear. If $x_n=c$ for all $n$ then your conditions are satisfied (for all $p$, in fact). Please give some thought to what you really want to ask. –  Gerry Myerson Aug 15 '11 at 12:52
Perhaps you will find helpful Hensel's Lemma, though, perhaps, your question - once fixed - may be a special case. –  Bill Dubuque Aug 15 '11 at 13:43
@Gerry Myerson: Thanks for spotting the mistake. The question should make more sense now. ;) –  Ola Aug 15 '11 at 14:46
@Bill Dubuque: Thanks for the suggestion, it looks promising. I am processing the article... :) –  Ola Aug 15 '11 at 14:51
Ola, part of the question is fixed, part is still broken. Don't you want the condition to be on $x_{n+1}^2$? –  Gerry Myerson Aug 15 '11 at 22:48

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.