satisfied all field axioms except multiplicative inverse.
Fermat's theorem
If is prime and then
Example:
If is not prime, then isn't a field.
An element is a zero divisor if such that and but .
Notice that which is our
These zero divisors can't have multiplicative inverses.
If is not prime, write
Now so then is not a field.
3
Example of a multiplicative inverse.
Now to break this, we need a multiplicative inverse where it breaks that it should equal
We need to somehow find that there aren't any real numbers that result in here.
4
Fermat's Little Theorem:
if are such that is prime and , then .
This is not congruent
We need to show doesn't have a remainder of when divided by .
1
a)
Show that is closed under addition and multiplication
If
Does and does
Addition:
So we know but
Let and
Then we have
So we have shown that it still takes in the form as defined by .
Multiplication:
Now
Let because
Let because .
So we have which is in
Solution:
Let and
Above solution is correct.
b)
Show that is a field.
Since has most of the axioms true, such as commutativity, associativity, etc. We just need to prove the additive inverse and the multiplicative inverse.
So let's show that there is and
Let and
now we have
Solution
Commutativity is inherited down from and so is associativity, etc.
Multiplicative Inverse:
Let
So , this doesn't seem to be of the correct form for being in .