1 2 8 Problem Let P Be A Prime Let F X C Ex Crt Be Any Polynomial In X Suppose That The Polynomial Congrue 1 (8.23 KiB) Viewed 17 times
give me correct answer
1.2.8 Problem Let p be a prime. Let f(x) = c +ex+ ... + crt" be any polynomial in x. Suppose that the polynomial congruence S(x) = 0(modp) has more than n solutions. Then each cis divisible by p.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!