MATHmaniac aka CrUNchy

THEOREM 1
Let P be a prime number and suppose that P is not divisible by a.Then,

THEOREM 2
If P is a prime number,then for any integer a.

Now,Using Fermat's Theorem we're going to proof:

a)
Theorem 1 said, so,



.
.
.

thus,

simplify it,

How (P-1) become congruence to -1??
Ok,let's say P as 19
so,when (19-1) become 18,then


b)
THEOREM 2 said,
so,



.
.
.

thus,

simplify it,

How come
Again P as 19,thus

• 
• 
• 
• 
•