Hi there,

I have been trying to prove Fermat's little Theorem is divisible by x when x is a prime number) by using mathematical induction and without using modular arithmetic. I think I have got the proof all correct but if someone could quickly read through it to make sure it is correct it would be very helpful and for those people that are experts at math I don't think it would take very long at all!

I have tried to use LaTex but I am not too sure how well I succeeded in using it. So as a backup I have also made a screenshot of it typed up in word so that you can see it there. I have hyperlinked to the image hosted on imageshack.

Link to image proof: Imageshack - induction.png

Typed Proof:

denotes (binomial theorem)

P(k) = is divisible by x when x is a prime

Check when k=1 x=2

P(2) = = 0 so true for P(1) assume true for P(k)

(where A is an integer)

Prove P(k+1)[/tex] is divisible by 2

(substitute in )

So divisible by 2 when x=2 for all k.

Prove for all x

is divisible

P(1) which is divisible by x

Assume true for k

(where x is a prime and A is any integer)

(simplify)

(substitute in )

is divisible by x when x is a prime and or because there are no prime factors in the denominator but there is one in the numerator. As in the above equation the binomial coefficients don’t have or . So a common x may be brought out

(bringing out x)

So by principle of mathematical induction is divisible by x when x is a prime and k is any positive integer.

So if you could point if it doesn't work out and why it would be much appreciated.

Thanks again

Qwertyuiop23

(Hopefully I have explained myself well enough)