You are on page 1of 16

Proof of Fermat’s Last Theorem

[Based on Elementary Mathematical Tools]

By:

Ranjeet S Mudholkar
ranjeetmudholkar@gmail.com
Special Thanks

I would like to accord my sincere appreciation to Ms. Anita Govilkar and Mr.
PDL Ganpati Sarma, both qualified mathematicians of repute having over two (2)
decades of background as senior academicians in the said discipline.

Anita and Ganesh have consistently helped over a period to develop the given proof
and their collective corroboration and validation has established the testimony to be
legitimate beyond a shadow of doubt, within the realm of science.

I take this opportunity to express an honorable mention for their professional


contributions, without which this research would not have been successful.

Anita Govilkar

Anita Govilkar has over twenty-five (25) years of experience as mathematics teacher in coaching
students all across the world including Australia, India, and United States (US) amongst others; Armed
with Master’s Degree(s) in Mathematics and Statistics, she has authored several books in the topics in
the subject, which are published in the print and electronic media. [Contact :
anitagovilkar@gmail.com]

PDL Ganpati

PDL Ganpati has vast experience of over twenty (20) years as an academician teaching mathematics all
across. He has Double Masters in the discipline(s) of Mathematics and Education, and he has written
several academic treatise and books which are adopted by many schools across India as well. His
Research has been presented in many academic conferences and which is widely published and
professionally cited.[Contact : pdlsarma@gmail.com]
Contents

Sr. No. Topic Page No.

1 Introduction 1

2 Pythagorean Triples 3-5

3 Fermat’s Last Theorem 6-8

4 Conclusion 9

5 Acknowledgments 9

6 References 10

7 About the Author 10

#:© Ranjeet S Mudholkar


Proof of Fermat’s Last Theorem
[Based on Elementary Mathematical Tools]

1
Ranjeet S Mudholkar

1. Introduction to Fermat’s Last Theorem

We present an attempt to prove the Fermat’s Last Theorem based on elementary mathematical tools.

The pre-eminent French lawyer and amateur mathematician, the late Advocate – Pierre
de Fermat (1607 − 1665) in 1637, famously in the margin of a copy of the famous
book Arithmetica which was written by Diophantus of Alexandria (∼ 201 − 215
AD), wrote:

“It is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or
in general, any power higher than the second, into two like powers. I have discovered a truly
marvelous proof of this, which this margin is too narrow to contain.”

In the parlance of mathematical symbolism, Fermat’s Last Theorem can be written


succinctly as:

/ ∃ (x, y, z, n) ∈ N+: xn + yn = zn for (n > 2), --------------------------------------------- (1)

where the triple (x, y, z) /= 0, is piece wise co-prime, and N+ is the set of all positive
Integer numbers. This theorem is classified among the most famous theorems in all the
history of mathematics and prior to 1995, proving it was and is; ranked in the Guinness
Book of World Records as one of the “ most difficult mathematical problems” known to
humanity. Fermat’s Last Theorem is now a true theorem since it has been proved, but
prior to 1995 it was only a conjecture. Before it was proved in 1995, it is only for
historic reasons that it was known by the title “ Fermat’s Last Theorem”.

1Email Address: ranjeetmudholkar@gmail.com

1
The first correct proof was supplied only 358 years later by the English Professor of
mathematics at the University of Cambridge–Sir Andrew John Wiles (1953−), in 1995
Wiles (1995).

Herein, we present an attempt to prove the Fermat’s Last Theorem based on


elementary mathematical tools.

That said, we must hasten to say that, as a difficult mathematical problem that so far
yielded only to the difficult, esoteric and advanced mathematical tools and methods of
Sir Professor Andrew Wiles – Fermat’s Last Theorem, as any other difficult
mathematical problem in the History of Mathematics, it has had a record number of
incorrect proofs of which the present may very well be an addition to this long list of
incorrect proofs.

In the words of historian of mathematics – Howard Eves Koshy (2001):

“Fermat’s Last Theorem has the peculiar distinction of being the mathematical problem for which the
greatest number of incorrect proofs has been published.”

With that in mind, allow us to say, we are confident our attempt to prove the proof we
supply herein is most certainly correct and hopefully, it shall most likely stand the test of
time and experience.

The proof that we supply herein leads us to strongly believe that Fermat might have had
the proof and this proof most certainly employed elementary methods of arithmetic!

2The proof by Sir Professor Wiles is well over 100 pages long and consumed about seven years of his
research time. For this notable achievement of solving Fermat’s Last Theorem, he was Knighted Commander
of the Order of the British Empire in 2000 by Her Majesty Queen Elizabeth (II), and received many other
honors around the World.

2
2. Pythagorean Triples

Euclid (b.300 BC) of Alexandria – Egypt provided a fundamental formula for


generating primitive Pythagorean Triples viz. given an arbitrary pair of positive
Integers a and b with a > b>0, such that (a − b) is Odd. The formula states that the
Integers p, q and r:

p = a2 − b2 ; q = 2ab; r = a2 + b2 ------------------------------(2)

constitutes primitive Pythagorean Triple i.e., in which p, q and r are piecewise Co-
prime. By piecewise Co-prime, we mean that any combination of the Triple viz. p, q
and r has no common factor other than unity.

The 3Euclid's Formula is a fundamental formula for generating Pythagorean Triples


given an arbitrary pair of integers a and b with a > b > 0.

The Triple generated by Euclid's formula is primitive if and only if a


and b are Coprime and both are not Odd.

When both a and b are Odd, then p, q and r, will be Even, and the Triple will not be
primitive; however dividing p, q and r by 2 will yield a Primitive Triple when a and b
are Coprime and both Odd as well.

Every primitive Triple arises (after the exchange of p and q, if p is Even) from a
unique pair of Coprime numbers a, b, one of which is Even. It follows that there are
infinitely many primitive Pythagorean Triples.

Ref.: 3 https://en.wikipedia.org/wiki/Pythagorean_triple

3
As stated, a Pythagorean Triple which is not a multiple of another is called a primitive
Pythagorean Triple. All the primitive Pythagorean Triples are each generated once (if
and only if) one of a, b pair is Odd and the other is Even.

Despite generating all primitive Triples, the Euclid's Formula does not produce all
Triples—for example, (9, 12, 15) cannot be generated using integer “a” and “b”. This
is remedied by inserting an additional parameter “k” to the formula. Hence, the
following will generate all Pythagorean Triples uniquely:

p=k. (a2-b2), q= k. (2ab), r= k. (a2+b2) -------------------------------------------- (3)

where “a”, “b”, and “k” are positive integers with a > b, and with a and b Coprime
and both not Odd. Thus, we have:

3. (22-12) +3.(2.2.1)= 3.(22+12); or

92+122=152

These formulae generate Pythagorean Triples and may be confirmed by expanding a2


+ b2 using elementary algebra and verifying that the result equals c2. There are infinitely
many primitive Pythagorean Triples; hence there must exist infinitely many piecewise
Co-prime Triples viz. (p, q, r) ∈ N where N is the set of all positive Integers.

An important fact to note, which is directly emergent from the foregoing is that- all
the primitive Pythagorean Triples yield to Euclid’s Formula and further that the
Euclid’s set of primitive Pythagorean Triples comprises of all the primitive
Pythagorean Triples that exist in nature as well.

Additionally, since every Pythagorean Triple can be divided by some Integer “k” to
obtain a Primitive Triple; every Triple can be generated uniquely by using the formula
with “a” and “b” to generate its primitive counterpart and then multiplying through by
“k” as well.

Furthermore, there are always a, b values for all p, q, r where p, q, r ∈ N but they are
not always Integers: For e.g. If a, b generates p, q, r; then k×p, k×q, k×r is generated
by √k a, √k b; where k ∈N. For e.g., set (28.8, 38.4, 48) forms Pythagorean Triple; where
a, b, c are 3,4,5 respectively, and k= 9. Choosing “a” and “b” from certain Integer
sequences gives interesting results. For example, if “a” and “b” are consecutive Pell
numbers, “p” and “q” will differ by 1.

4
Please find below a 4table of Pythagorean Triples with a smaller number(s) up to 40
(wherein a and b is replaced as m and n respectively with reference to as stated above0:

Additionally, the process for seeking 5Generalised Pythagorean Triples could also be
proved by using:

(i) Fundamental theorem of Arithmetic

(ii) Polynomial parameterization for Projective Conics

(iii) Pythagorean Triple preserving Matrix using Projective Transformation

Ref.: 4 http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Pythag/pythag.html
Ref.: 5 Generalized Pythagorean Triples and Pythagorean Triple Preserving Matrices by Mohan Tikooand Haohao
Wang

5
3. Fermat’s Last Theorem

The equation xn + yn = zn has no +ve Integer solutions for n≥3, where x, y, z, n € N

Proof : By Exhaustion

Let there exist n € N such that f(x,y,z): xn+yn=z n where x, y, z € N -------------------- (4)

Now, we shall find all the possible values of n € N which fulfil the above said
equation wherein the variables x, y, z € N.

We shall find the values(s) of n for the two (2) cases viz.:

(i). When n is an Even number, i.e., when n= 2k; where k € N and

(ii). When n is an Odd number, i.e., when n= 2k+1; where k € N

Thus, this will encompass the entire set of N for n; such that the two (2) cases are
Exhaustive:

Here the set N= { 1,2,3,4. ....... ∞ }

Case 1: Let n be an Even number, thus for xn/2 (i.e., say p), yn/2 (i.e., say q), z n/2
(i.e., say r); xn/2, yn/2, zn/2 € N, and we then have f(p,q,r), that formsPythagorean Triples:

We have; f (p,q,r) = (p)2 + (q)2 = (r)2 ----------------------------------------------- (5)

As per 6Euclid Theorem, for any random a, b, k € N such that a>b, we have the set
{k(a2-b2); k(2ab); k(a2+b2)} that forms Pythagorean Triples - primitive as well as non-
primitive, viz.:

k(a 2-b 2)2 + k(2ab)2 = k(a 2+b 2)2 --------------------------------------------------------(6)

We know that every primitive Pythagorean Triple can be generated uniquely by using
the Euclid’s Formula as stated above; and the insertion of additional parameter “k” as
given below will yield all the Pythagorean Triples in order and vice versa as well.

Ref.6: http://mathforum.org/dr.math/faq/faq.pythag.triples.html

6
Hence, from (5) and (6) without the loss of generality, it is deductively inferred that:

p = xn/2 = k (a2-b2); => xn = [k (a2-b2)] 2--------------------------------------------------- (7)

q = yn/2 = k (2ab); => yn = [k (2ab)] 2 ----------------------------------------------------- (8)

r = zn/2 = k (a2+b2); => zn = [k (a2+b2)] 2 -------------------------------------------------- (9)

Accordingly, we have,

x = [k(a2-b2)]2/n ; where [k (a2-b2)] € N; x € N , hence 2/n € N or n=2 ------------- (10)

y = [k(2ab)]2/n ; where [k(2ab)] € N; y € N , hence 2/n € N or n=2 ---------------- (11)

z = [k(a2+b2)]2/n ; where [k(a2+b2)] € N ; y € N , hence 2/n € N or n =2 -----------(12)

As the equations (7), (8), and (9) are based on (4) and the Euclid Theorem as stated in
(6), they are true for all n € N, for all the Even cases as deductively inferred above.

Thus, solving (10), (11), and (12), the Even positive Integer(s) that satisfy the given
equations such that x, y, z € N as well as xn/2, yn/2, zn/2 € N for all n € N, where n
is Even is only when:

2/n € N OR only when n=2.

Thus, with reference to the above said equation(s), i.e., as stated in (4) viz.; xn+yn=zn, for
any Even number n, we have the following Exhaustive solution(s):

(i) If n € N and n>2 then, x, y, z DO NOT € N[ i.e., when n is Even]

(ii) If n € N and n=2 then, x, y, z € N [i.e., when n is Even]

Hence, it is proved that, for (4) viz. xn+yn=zn, wherein x, y, z € N there DOES NOT exist
any solutions for n>2 (for all Even; and the only solution wherein x, y, z € N exists when
n= 2, i.e., for all Even number(s)).

7
Case 2: Let n be Odd, Let us replace n by m; where m = (n+1), which is Even.

Thus xm/2, ym/2 and zm/2 are positive Integer.

As stated in Case 1, it may be observed that the only Even positive Integer such that x,
y, z € N as well as xm/2, ym/2, zm/2 € N, is only when:

2/m € N OR when m=2 OR only when n=1; (as m=n+1)

Thus, with reference to the above said equation, i.e., as stated in (4) viz. xn+yn=zn for
any Odd number n, we have the following exhaustive solution(s):

(i) If n € N and (n+1)>2 then, x, y, z DO NOT € N [i.e., when n is Odd]

(ii) If n € N and n=1, then, x, y, z € N [i.e., when n is Odd]

Hence, its proved that for (4) viz. xn+yn=zn wherein x, y, z, n € N there DOES NOT exist
any solutions for n>1 (for all Odd), as well; and the only solution wherein x, y, z € N exists
only when n=1, i.e., for all Odd number(s).

Accordingly, it is conclusively proved that, for (4) viz. xn+yn=zn, the Exhaustive
Solution(s) for all case(s) of x,y,z wherein n, x, y, z € N are only when n = 1 and n =
2; for all Even and Odd number(s) respectively and no other solutions exists for x,y,z
wherein x,y,z € N when n>2 viz. for any other n € N

Q.E.D.

8
4. Conclusion

We hereby put forward the following conclusions:

(i) By use of the method of “Pythagorean triples”, we have demonstrated that a solution
to Fermat’s Last Theorem exists in the realm of elementary arithmetic.

(ii) This proof employs elementary arithmetic tools and methods that were certainly
accessible to Fermat, thus making it highly likely that Fermat’s claim that he
possessed a “truly marvelous” proof may very be true.

5. Acknowledgments

We are grateful to G. G. Nyambuya from Department of Applied Physics, National


University of Science and Technology, Bulawayo, Republic of Zimbabwe, (Email
address:golden.nyambuya@nust.ac.zw) from whose paper “ On a Simpler, Much More
General and Truly Marvelous Proof of Fermat’s Last Theorem (II)” the literature on Fermat’s
Last Theorem has been taken.

Additionally, although a similar concept using the Pythagorean Triples has been
utilized by the above said expert to solve the Fermat's Last Theorem, however the
method applied by the present author is different.

We also reproduce the acknowledgement from the above said Paper as well below:

“………………………………………………………………………………….....
We are grateful to the National University of Science & Technology (NUST)’s Research & Innovation Department
and Research Board for their unremitting support rendered toward our research endeavors; of particular mention, Prof.
Dr. P. Mundy, Dr. P. Maroni. Dr. D. J. Hlatswayo, and Prof. Y. S. Naik’s unwavering support. We must make
mention of the fact that this work was inspired some twenty-two years ago by Marist Brothers Secondary School, Dete,
Zimbabwe’s then mathematical prodigy and now medical practitioner Dr. Charles Muzondi. This reading is dedicated to
my mother Setmore Nyambuya and to the memory of departed father Nicholas Nyambuya (27.10.1947 −
23.09.1999).”

……………………………………………………………...………………….”

9
6. References

(i) Aczel, Amir D., (1996). Fermat’s Last Theorem, Dell Publishing, N. Y., pp. 123 -
134.

(ii) Jacobson, N., (1989). Basic Algebra, II. W.H.Freeman, New York.

(iii) Ribenboim, P., (1999). Fermat’s last theorem for amateurs, Springer- Verlag, New
York.

7. About the Author

Ranjeet till recently was serving as the Vice-Chairman and CEO of Next-Gen Finance Enablers (NGFE)
(formerly known as Financial Planning Standards Board India); It’s a public – private enterprise promoting
financial planning since its inception viz. 2002. It conducts its activities by managing education programs,
publication of journal conducting events, and working towards the professional standards and regulations
in the discipline. It is well regarded as an established institution, and duly recognized for its efforts in
Financial Literacy and Financial Educational by all the stakeholders.

Since 2002, Ranjeet has led the transformation of the institution by ensuring that the vision and the goals
of the organization under the successive Boards are well executed, keeping all the stakeholders aligned. On
a larger scale, he has been demonstrating strong leadership in ensuring the scalability and the knowledge
base of the Financial Planning community, which has led to over 35,000 professionals aspiring to seek career
out of which over 20,000 professionals are in Financial Advisory discipline. He has been spearheading the
Financial Planning movement in the country essentially advocating the importance and awareness of goal-
based approach in personal finance for the financial well-being for households all across. He is also the
Editor of Financial Planning Journal, a well-regarded academic publication. Additionally, he has many
publications viz. Research Papers to his credit and he is a regular contributor for hundreds of articles/quotes
in the media, some of which have been cited in the international academic publications in Australia, US
etc.as well.

Prior to joining NGFE, he was GM-Human Resources, and before that he served as the Director of
Symbiosis Institute of Management Studies (SIMS), Pune a premier business management school, between
1997 and 2001. The Institution demonstrated luminous progress during his stewardship. In his professional
career he has been pivotal towards the institution(s) building by virtue of transformation leadership and
creating several “Bodies of Knowledge” in all the organizations he has served, respectively.

He has been featured as “Mr. Turnaround” by Times of India, “Smart People” by Business Standard, and
“Front Runner” by Business India. His name is also published in the “World’s Who’s Who” Marquis 19th
edition, for being the youngest Director of any Business School in the World.

~
10

You might also like