Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Say $g(x) = x^3 + x^2 − 5$. I need to show that for $i = 1,2,3,4,..$ There exists a unique $x_i \mod 7^i$ s.t

$g(x_i) ≡ 0 \mod 7^i$

I am not sure how to go about this. Any ideas on where to start?

share|cite|improve this question
If $7_i$ means $7^i$ then you may use Hensel's Lemma, on which there are already many answers. – Math Gems Feb 26 '13 at 1:48
Where to start is with $i=1$ (I'm assuming your $j$ was meant to be an $i$). Can you solve $x^3+x^2-5\equiv0\pmod7$? Then after that, it's Hensel time. – Gerry Myerson Feb 26 '13 at 2:26
I don't really understand hensel lifting. I can solve for $g(x_i) ≡ 0 \mod 7$ .. but after that do I just try and solve for $i=2,3,4,..$ until I find a pattern? – ker12 Feb 26 '13 at 2:39

Read Hensel's Lemma Statement here (which, in fact, is part of the proof) , and then you'll know what to do.

For example:

$$g(x)=x^3+x^2-5=0\pmod 7\Longrightarrow x^3+x^2+2=(x-2)(x^2+3x-1)\pmod 7$$

Note that the quadratic above is irreducible in $\,\Bbb F_7[x]=\left(\Bbb Z/7\Bbb Z\right)[x]\,$ (why?)

Now, checking the link given above, define (check the root $\,x=2\,$ is simple and thus $\,g'(2)\neq 0\,$ !)


$$ s=2-32\cdot 7\pmod {7^2=49}=-26\pmod{49}=23\pmod{49}$$

and indeed:


Well, continue as above with higher powers of $\,7\,$...

share|cite|improve this answer

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.