- For both Exercises 1 and 2, looking at Exercise 5.34 from [GG99]
should be helpful.
- For computing the bound
, looking at Exercise 2 of Quiz 1
of last year can be helpful too.
This bound should look like
- For Exercise 1, it is important to remember the following fact.
be two polynomials in
(for some integer
, prime or not)
such that the leading coefficient of
Then, there exists a unique couple
The algorithm for the division is in the first section
of the Chapter From Newton to Hensel on our web site.
Marc Moreno Maza