Proof of Fermat's Little Theorem for Prime p and Polynomial g(x) in Z_p[X]

Dunkle
Messages
54
Reaction score
0

Homework Statement



For a prime p and a polynomial g(x) that is irreducible in Z_{p}[X], prove that for any f(x) in Z_{p}[X] and integer k > 1, [f(x)]^{k} = [f(x)] in Z_{p}[X]/(g(x)).


The Attempt at a Solution



I realize this is an extension of Fermat's Little Theorem, however I cannot figure out how to proceed. I attempted to adapt a proof of FLT for the integers modulo p, but couldn't get anywhere. Any nudges in the right direction would be greatly appreciated!
 
Physics news on Phys.org
Did you mean "there exists an integer k > 1" instead of "for every integer k > 1"?


What is the proof of FLT you're trying to adapt? What part of it doesn't work?
 
Yes, Hurkyl, I meant there exists an integer k > 1. Sorry about that.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top