Answer to Question #80892 - Math / Abstract Algebra
Question. Let be a prime and such that . Show that .
Answer. We will prove a more general statement: for every non-zero , if , then . Applying this statement with gives the desired statement. This more general statement will be proved in two stages as follows.
- We will prove that if , then . The proof is by induction.
- Induction base with . Assume that . It is the same as because .
- Induction step. Let be non-zero. Assume that implies . Assume that . We have that , then as is prime, by Euclid's lemma, or .
* If , then by the induction hypothesis.
* If , there is nothing to prove.
We considered all cases, and is true in all cases.
- We will prove that if , then . Assume that . The proof is by induction.
- Induction base with . We have by the assumption because and .
- Induction step. Let be non-zero. Assume that . By the properties of division, the induction hypothesis, and the assumption , we have . This is the same as .
Answer provided by https://www.AssignmentExpert.com
Comments