Fermats Last Theorem

Let the Positive integers be classified as follows:

a) Prime numbers
b) Odd numbers
c) Even numbers (which are further classified as: )
a. Powers of 2
b. Non powers of 2
Let us consider that,
Where
Now let us move to the categories one by one
Category 1 (Prime Numbers)
Let, be any prime number
And let,
Or,
According to Fermats Little Theorem,

Or,
Or,
In other words, if (1) is true then

(1)

[
must be divisible by .

(2)

Let,
If we classify
into odd or even numbers then we get 6 combinations (4C2), which are as follows:
i)
Even + Even - Even = Even
ii)
Odd + Odd - Even = Even
iii)
Odd + Even - Even = Odd
iv)
Odd + Odd - Odd = Odd
v)
Even +Even - Odd = Odd
vi)
Odd + Even - Odd = Even
But out of these 6 possibilities 3 are not valid; those are (iii), (iv) and (v).
It clearly shows that
must be an even number.
Thus, must be an even number.
But only prime number which is an even number is 2.

Form(1),
But for p being other prime numbers,
(3)
Category 2 (Odd Numbers)
Let, all odd numbers be expressed as

, where

So, in this category,

Or,
Or,
But from (3) the above mentioned equation is true only for
But here is an odd prime number.
So,

being an even prime number.

Where,
Category 3 (Even Numbers)
Part A (Non powers of 2)
Let,
Where,
And
Or,
Or,
But, from (3), the above equation holds true only when
the equation does not hold true.
So we can conclude,

is even, but here

Where,
Part B (Powers of 2)
Let,
Where,

is an odd prime number, so

According to Fermats Little Theorem,

Or,
Or,
Similarly,
Similarly,
(4)
But, Category 1
to 0 only.

must be even to satisfy

. Thus the above expression is congruent

So,
Or from (2),
Again from (4),
Or,
Thus a contradiction arises. If we continue the contradiction continue too.
So, our assumption limits upto
only.
So,
Where,
Thus we have been able to prove that for
must be equal to 1 or 2.
Thus we have been able to prove Fermats Last Theorem