$(p-1)! = -1 \bmod p$ where $p$ is prime.
I know that there are a lot of ways to prove it with all beauty of different sides of math:
1) Elementary way (to divide in pairs where $x_1 x_2 = \pm 1$)
2) To use Fermat's little theorem and Lagrange theorem with try to prove $x^{p-1} – 1 = (x-1)\dots(x-(p-1)))$
But my teacher wants me to prove it using theory of the finite Galois Fields. He wants me to use material which we study now.
We studied on our last lectures:
- A set of residue classes
- The decomposition field of the polynomial $x^{p^m} – x$
- Cyclicity of the multiplicative group of the field
- Giving the field by the root of an irreducible polynomial
- Structure of finite fields
- Isomorphism of the Galois fields
- Automorphism of the Galois field
- Representation of the Galois field by matrices
Maybe this proof is on this site, but I can't find it. And I can't think of proof based on things that I mentioned.
Sorry if it is some kind off-topic.
But does anybody know other proof based on mentioned material?
Hint from teacher: consider constant term of $x^{p-1} – 1 $, but it can't be the second proof, because it is based on theory of groups at all, the previous chapter of our lectures, not the theory of the finite Galois field, current chapter of our lectures.
Best Answer
By Vieta's Formulas we know that the constant term of a polynomial is equal to the product of the roots of the polynomial when the degree is even, and the negative of that when the degree is odd. Since $\mathbb{F}_p^\times$ is cyclic of order $p-1$, any non-zero element of $\mathbb{F}_p$ satisfies $x^{p-1}-1=0$. Handling the $p=2$ case separately, we see that $p$ is odd so $p-1$ is even, so $-1$ is the product of all the roots of $x^{p-1}-1$. We have already observed $p-1$ unique roots to this equation, and since $\mathbb{F}_p$ is a field, it has exactly $p-1$ roots and so the roots are precisely the the non-zero elements with no repeats and we are done.
In the comments, it is mentioned that this holds not just in $\mathbb{F}_p$ but generally in $\mathbb{F}_q$. This proof generalizes because, by construction, the elements of $\mathbb{F}_q$ satisfy $x^q-x=0$. Dividing both sides by $x$ and continuing as stated in the above proof yields the result. In the general theorem, the $p=2$ case still needs to be handled separately and is less trivial.
NB: This is the same concept as your proof 2, but justified using language of Field Theory. In general, the boundary between "Galois Theory Concepts" and "number theory concepts" is pretty loose when it comes to Modular Arithmetic.