You are about to erase your work on this activity. Are you sure you want to do this?
Updated Version Available
There is an updated version of this activity. If you update to the most recent version of this activity, then your current progress on this activity will be erased. Regardless, your record of completion will remain. How would you like to proceed?
Mathematical Expression Editor
[?]
Remind me: what are the necessary ingredients for a proof by induction?
Our goal is to prove the following theorem:
Suppose that is an even number and a prime which does not divide .
Suppose that does divide . Then is of the form for some positive integer .
In order to prove this theorem, we’ll need the so-called “Little Fermat Theorem”. You can find Euler’s proof of this
theorem in your text.
Little Fermat Theorem Let be a whole number and a prime which does not divide . Then
divides .
(Divisor Question) Suppose that is any whole number, and that you divide by some number . What are the
possible remainders? What are the possibilities for how you could write as related to a multiple of ?
(Cases Question) Repeat the divisor question, but related to Theorem EFT and the case . In other words, what
are the possibilities for the prime when you divide by ? Then, eliminate all but two of these cases.
(Contradiction Question) Use proof by contradiction to eliminate the case you don’t want.
Repeat the cases question and the divisor question, but for the case . If you’re confident you understand what’s
going on, move to the next question!