fortin946
Apr13-11, 10:12 PM
When we have f(x) = 0 mod (p1p2...pk), I know that using the Chinese Remainder Theorem, the maximum number of solutions is:
the product of the maximum number of solutions for f(x) = 0 mod(pi).
which is the degree of the polynomial f(x).
then here we have at most k*deg(f).
However, in the case we are modulo (pk), I am wondering how I can find the maximum numbers of solutions for f(x) = 0 (pk) ?
the product of the maximum number of solutions for f(x) = 0 mod(pi).
which is the degree of the polynomial f(x).
then here we have at most k*deg(f).
However, in the case we are modulo (pk), I am wondering how I can find the maximum numbers of solutions for f(x) = 0 (pk) ?