Proof Fermat’s Last Theorem
Shahbaz Ahmed
Abstract
If
Ax < C z (1)
By < C z (2)
Where A,B,C,x,y and z ∈ { 3,4,5,.......} Then ,there exist positive rational numbers
t1 (t1 < 1) and t2 (t2 < 1) having no common factors such that :
Ax = t 1 C z (3)
B y = t2 C z (4)
Adding equation(3) and equation(4)
Ax + B y = (t1 + t2 )C z (5)
Now if
t1 + t2 = 1 (6)
Then
Ax + B y = C z (7)
The A,B C satisfying the above equation will have common prime factors.
Subject Classification Codes MSC :11A05,11A41,
11D09,11D41,11D61,11N32
Key words:Beal’s Conjecture,Rational numbers,Prime Num-
bers
1. Introduction
A number of proof of Beal’ Conjecture have been published but the author has proved the
same with simple algebraic technique.
2.Statement of the Problem
1
Shahbaz Ahmed
Abstract
If
Ax < C z (1)
By < C z (2)
Where A,B,C,x,y and z ∈ { 3,4,5,.......} Then ,there exist positive rational numbers
t1 (t1 < 1) and t2 (t2 < 1) having no common factors such that :
Ax = t 1 C z (3)
B y = t2 C z (4)
Adding equation(3) and equation(4)
Ax + B y = (t1 + t2 )C z (5)
Now if
t1 + t2 = 1 (6)
Then
Ax + B y = C z (7)
The A,B C satisfying the above equation will have common prime factors.
Subject Classification Codes MSC :11A05,11A41,
11D09,11D41,11D61,11N32
Key words:Beal’s Conjecture,Rational numbers,Prime Num-
bers
1. Introduction
A number of proof of Beal’ Conjecture have been published but the author has proved the
same with simple algebraic technique.
2.Statement of the Problem
1
