Question

Using Fermat's little theorem prove that 979 is a prime number.

Answer 1

I know that you have to prove that x^(p-1) = 1 mod p.
Using x = 2 to calculate 2^978 we need to write it in a form which is easy to do the calculation on. This is where I have difficulties.

Answer 2

if we take a simple example - show that 39 is not prime we would write