Shi Feng Sheng Danny Wong

Similar documents
On the Cardinality of Mersenne Primes

= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2

Fermat s Last Theorem for Regular Primes

Fermat s Marvelous Proofs for Fermat s Last Theorem. Abstract

History of Mathematics

Contents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

5.2. Perfect Numbers Divisors of a natural number were covered in Section 5.1.

Discrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set

An Elementary Proof Of Fermat s Last Theorem

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR

Number Theory. Jason Filippou UMCP. ason Filippou UMCP)Number Theory History & Definitions / 1

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n

Elementary Number Theory

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Exploring Number Theory via Diophantine Equations

A proof has to be rigorously checked before it is published, after which other mathematicians can use it to further develop the subject.

Sundaram's Sieve. by Julian Havil. Sundaram's Sieve

Proof of Beal s Conjecture

Some Highlights along a Path to Elliptic Curves

Math Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013

In Defense of Euclid. The Ancient Greek Theory of Numbers

MthEd/Math 300 Williams Fall 2011 Midterm Exam 2

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures

Introduction: Pythagorean Triplets

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

Primes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1

The Surprising Proofs

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

The world of Diophantine equations

A versatile proof of Fermat s last theorem

CHMC: Finite Fields 9/23/17

8 Primes and Modular Arithmetic

Table of Contents. Number and Operation. Geometry. Measurement. Lesson 1 Goldbach s Conjecture Lesson 2 Micro Mites... 11

Chapter 1. Complex Numbers. 1.1 Complex Numbers. Did it come from the equation x = 0 (1.1)

9.4. Mathematical Induction. Introduction. What you should learn. Why you should learn it

Elliptic Curves. Kenneth A. Ribet. PARC Forum October 17, UC Berkeley

1.7 Proof Methods and Strategy

Fermat s Last Theorem

Diophantine equations

SQUARE PATTERNS AND INFINITUDE OF PRIMES

Math 312, Lecture 1. Zinovy Reichstein. September 9, 2015 Math 312

Math 4388 Amber Pham 1. The Birth of Calculus. for counting. There are two major interrelated topics in calculus known as differential and

C.T.Chong National University of Singapore

Junior Villafana. Math 301. Dr. Meredith. Odd Perfect Numbers

Introduction to Complex Numbers Complex Numbers

SUMS OF SQUARES WUSHI GOLDRING

Pierre de Fermat ( )

The roots of computability theory. September 5, 2016

Appendix G: Mathematical Induction

Indtroduction to Diophantine Equations

Elementary Introduction to the Langlands Program. III

Grade 7/8 Math Circles. Mathematical Thinking

Beyond Newton and Leibniz: The Making of Modern Calculus. Anthony V. Piccolino, Ed. D. Palm Beach State College Palm Beach Gardens, Florida

Elliptic Curves and Mordell s Theorem

Logic and Mathematics. 1. Lecture

5.1. EXAMPLE 1 Decide whether the first number listed is divisible by the second. (a) 45; 9

LECTURE 1: DIVISIBILITY. 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers

0. Introduction. Math 407: Modern Algebra I. Robert Campbell. January 29, 2008 UMBC. Robert Campbell (UMBC) 0. Introduction January 29, / 22

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3

Elliptic Curves: An Introduction

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory.

NUMERICAL METHODS C. Carl Gustav Jacob Jacobi 10.1 GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING

GROUP ROUND INSTRUCTIONS

A NICE DIOPHANTINE EQUATION. 1. Introduction

Foundations of Basic Geometry

THE MATHEMATICS OF EULER. Introduction: The Master of Us All. (Dunham, Euler the Master xv). This quote by twentieth-century mathematician André Weil

300-Level Math Courses

Direct Proof and Counterexample I:Introduction

CHAPTER V Fermat s last theorem

Outline of the Seminar Topics on elliptic curves Saarbrücken,

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Sums of four squares and Waring s Problem Brandon Lukas

Figurate Numbers: presentation of a book

A Simple Short Proof of Fermat's Last Theorem

Chapter 12: Ruler and compass constructions

On Fermat s marginal note: a suggestion

Rational Points on Conics, and Local-Global Relations in Number Theory

Gaussian integers. 1 = a 2 + b 2 = c 2 + d 2.

Riemann s Hypothesis and Conjecture of Birch and Swinnerton-Dyer are False

Minal Wankhede Barsagade, Dr. Suchitra Meshram

= 0. Theorem (Maximum Principle) If a holomorphic function f defined on a domain D C takes the maximum max z D f(z), then f is constant.

MATH 25 CLASS 8 NOTES, OCT

What is proof? Lesson 1

Symbolic Analytic Geometry and the Origins of Symbolic Algebra

Grade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015

The Ring Z of Integers

Cambridge University Press How to Prove it: A Structured Approach: Second edition Daniel J. Velleman Excerpt More information

Impact of Women in Number Theory

1.7 Proof Methods and Strategy

SERIES ARTICLE Dawn of Science

In today s world, people with basic calculus knowledge take the subject for granted. As

SOME FAMOUS UNSOLVED PROBLEMS. November 18, / 5

Small gaps between prime numbers

Integer-sided equable shapes

STUDY IN EGYPTIAN FRACTIONS

Computer Algebra Systems Activity: Solving Diophantine Equations

What do you think are the qualities of a good theorem? it solves an open problem (Name one..? )

Notice how these numbers thin out pretty quickly. Yet we can find plenty of triples of numbers (a, b, c) such that a+b = c.

EXAMPLES OF MORDELL S EQUATION

Transcription:

Exhibit C A Proof of the Fermat s Last Theorem Shi Feng Sheng Danny Wong Abstract: Prior to the Diophantine geometry, number theory (or arithmetic) was to study the patterns of the numbers and elementary calculation techniques The 1637 Fermat s Last Theorem (FLT) is the 1 st important elusive problem in number theory originated from Diophantine geometry. Leonhard Euler tried and failed to resolve the (FLT) during the 18 th century. However, it marked the (rebirth) of (FLT) as the beginning of modern number theory. (FLT) has resisted every attempt at a solution, and may very well hold the key to the overall understanding of the problems in number theory. After the proclaimed proof the Goldbach s conjecture, it became obvious that (FLT) is not an enigma. The objective here is to illustrate that Fermat s Last Theorem can be resolved by a relatively simple non-geometry-based procedure. 1. The Problem In about 1637, French mathematician Pierre de Fermat (1601-1665) noted in his copy of Arthimetica that he had a remarkable proof (by descent) that this indeterminate Diophantine equation is not solvable when N is an integer > 2. Fermat further noted that there was very little space left in the margin of his book to elaborate. 2. Early History Euclid s Elements (300B.C) introduced Euclidean geometry and provided the 1 st proof of infinitude of primes by abstract reasoning. Elements also devoted a part to primes and divisibility, topics that belong unambiguously to number theory. Diophantine (3 rd century) introduced a series book called Arithmetica. Diophantine studied rational points on the curves and algebraic varieties, and showed how to obtain infinitely many rational (points) satisfying a system of equations by giving a procedure that can be made of algebraic expression (the basic algebraic geometry in pure algebraic terms). Diophantine was the first mathematician who recognized fractions as numbers; thus he allowed positive rational numbers for the coefficient and solutions. Diophantine equations are usually algebraic equations with integer coefficients, for which integer solutions are sought. Unfortunately, most of the texts are lost. Nonetheless, Diophantine geometry and of Diophantine approximations are important to the researchers today. After the Greeks, not much happened to primes until Fermat introduced his prime numbers and number theory in the 17 th century. Unfortunately, his entire work on number theory was in the forms of private letters and marginal notes, and Fermat s Last Theorem was found long after his death without elaboration. (FLT) led to tremendous advances in number theory, and number theorists studied primes and the properties of objects make out of integers (such as rational numbers) or defined as generalization of integers (algebraic integers). Integers can be considered either in themselves of as solutions to equations (Diophantine geometry). 1 / 5

Moreover, the analytic geometry (coordinate geometry) was introduced by Rene Descartes (1596-1630) and Fermat (1601-1665). Fermat primarily studied the properties of elliptic curves (Diophantine equations). Descartes primarily studied the classic work on conic and cube; he introduced rectangular coordinates to locate points and enable lines and cures to be represented with algebraic equations, his algebraic geometry extended subject to multidimensional and non-euclidean spaces It was almost a century later, the analytic geometry was accepted by the 18 th century mathematicians mainly because it supplied with concrete quantitative tools needed to to study physical problem 1 using calculus of Newton and Leibniz. And during the same period; (a) Leonhard Euler (1707-1783) became interested of number theory after worked on many Fermat s unelaborated problems, including his unsuccessful attempt to resolve the (FLT), (b) Euler also applied the technique of the infinitesimal calculus and zeta function to investigate prime distribution, but unsuccessful in all front. Nonetheless, his failed attempt to resolve the (FLT) marked the rebirth of (FLT) as the beginning of modern number theory. 3. Recent History In about 1993-1994, Dr. Andrew Wiles proclaimed a lengthy proof of (FLT), which was based on a certain elliptic curve (from the 1954 Taniyama conjecture) did not exist and other deep theories. However, no one agreed that his proof was what Fermat had in mind due to the fact that his modern, far-reaching vision of mathematics did not exist during the Fermat s era. And during the same period, the 1993 Beal s conjecture was coined. Mr. Beal believed Fermat had a relatively simple non-geometry-based proof of (FLT). Beal s conjecture was accepted as an open question in number theory because his approach via common factor was very close to the research activities of the professionals. 4. Observation Fermat developed methods for (doing what in today s terms) amount to finding points on the elliptic curves (genus 1), but his annotation was completely divorced from the method of Diophantine. Fermat must have a simple non-geometric-based method due to the fact that: 1. Fermat claimed that his proof would fit into the margin of a book if he had a little more space; which implied that his proof (by descent) must be a very short one. 2. Fermat also implied that has solution when N = 2. 3. (an integer N > 2) is equivalent to (N 3), and Fermat never constrained X or Y in X N + Y N = Z N, so the options are: X = Y or X Y. 4. The proof of (FLT) by Dr. Wiles was based on deep modern theories that did not exist during the Fermat days. 5. Coincided with Mr. Beal s point of view. 1 Historically, mathematician/physicist Daniel Bernoulli (1700-1782) was at the forefront to adapt infinitesimal calculus to analyze his physical fluid motion problem, which his good friend Leonhard Euler (1702-1783) also contributed greatly. 2 / 5

4. The Solution The proclaimed proof of Goldbach s conjecture illustrated that all the even numbers > 2 can be expressed as the sum of two prime numbers, obviously, 4 = 2 + 2. (A) Fermat claimed that he had a proof (by decent) that equation is not solvable when N is an integer > 2. Since (N > 2) is equivalent to (N 3). Let: N descends from 3 to (1 and 2): Let: X = Y = 2 N = 1, 2, 3 N = 1: we have: 2 + 2 = 4 N = 2: X N + Y N Z N 2 2 + 2 2 4 2 (4 + 4 16) The same argument can be constructed to hold false for all the exponent N > 2. So: N = 3: X N + Y N Z N 2 3 + 2 3 4 3 (8 + 8 64) N = 4: X N + Y N Z N 2 4 + 2 4 4 4 (16 + 16 256) N = 5: X N + Y N Z N 2 5 + 2 5 4 5 (32 + 32 1024) Let: X Y, so X = 2, Y = 3 N = 1, 2, 3 N = 1: we have: 2 + 3 = 5 N = 2: X N + Y N Z N 2 2 + 3 2 5 2 (4 + 9 25) The same argument can be constructed to hold false for all the exponent N > 2. So: N = 3: X N + Y N Z N : 2 3 + 3 3 5 3 (8 + 27 125) N = 4: X N + Y N Z N 2 4 + 3 4 5 4 (16 + 81 625) N = 5: X N + Y N Z N 2 5 + 3 5 5 5 (32 + 243 3125) Fermat is correct that he had a remarkable proof (by descent) that this indeterminate Diophantine equation is not solvable when N is an integer > 2. Moreover, according to the Pythagorean Theorem: X + Y = Z (X + Y) 2 = Z 2 X 2 + 2X.Y + Y 2 = Z 2 X 2 + Y 2 = Z 2-2XY So: X 2 + Y 2 Z 2 3 / 5

(B). Fermat only claimed that has no solution when N is an integer > 2, which implied that has solution when N = 2: When N = 2: we have: X 2 + Y 2 = Z 2 From this perspective, Fermat could only mean the formula of Pythagorean right triangle: Let X = Y: (X + Y) 2 = Z 2 + 4 (1/2 XY) X 2 + 2XY + Y 2 = Z 2 + 2XY X 2 + Y 2 = Z 2 + (2XY 2XY) X 2 + Y 2 = Z 2 5. Additional Support Not everyone will accept this elementary non-geometry-based proof, but it is what it is. Moreover, additional [studies] further supported that this proof of the (FLT) is correct: [Study a]: Integer N > 2 is same as N 3, and Fermat never constrained X and Y. So: Let: X = Y = 2, descending N from 3 2: Variation: X N = Z N Y N When N = 2: 2 2 = Z 2 2 2 4 = Z 2 4 Z 2 = 8 Obviously: X N = Z N Y N can not be equal. However: Z 2 = 8 = 2 3 So: 2 2 = 2 3 2 2 Variation: 2 2 + 2 2 = 2 3 (4 + 4 = 8) An algebraic equation (of a particular form) can be formed so its solution to one N can be adapted to solve all the others: 2 N + 2 N = 2 N+1 N =1, 2, 3 N = 1: 2 1 + 2 1 = 2 2 2 + 2 = 4 N = 2: 2 2 + 2 2 = 2 3 4 + 4 = 8 N = 3: 2 3 + 2 3 = 2 4 8 + 8 = 16 N = 9: 2 9 + 2 9 = 2 10 1024 + 1024 = 2048 It seems unnecessary to continue any further. Fermat is correct that this indeterminate equation has no solution when N is an integer > 2. In fact, the equation X 2 + Y 2 = Z 2 could only exist as the formula for Pythagorean right triangle.. 4 / 5

[Study b]: Log X N = N log X, Log X + Log Y = Log (X x Y) Let: N = 2, 3, 4 Log (X N + Y N ) = N log Z log ( X N + Y N ) N = ---- ------------------ = 1. (A) log Z Log 10 = 1; therefore, the only possibility for N to have a whole number solution in equation (A) is when X N + Y N = 10 and Z = 10: Take: Variation: X N + Y N = 10 N X N = 10 N Y N N log X = log (10 N Y N ) log (10 N Y N ) But: N = ---------------------- 1. (B) log X Log 10 = 1; therefore, it is impossible for equation (B) to have any whole number solutions. Fermat is correct that this indeterminate equation has no solution when N is an integer > 2. 6. The Conclusion (FLT) is correct, and it is well founded that Fermat claimed that he had a truly remarkable proof by (descent) due to the fact that this indeterminate equation X 2 + Y 2 = Z 2 can not be solved as an algebraic equation, but the answer could be verified. External links are retrieved for general information related to Fermat s Last Theorem only: [1]. The world s most famous math problems by Marilyn Vos Savant. [2]. a generalization of Fermat s Last Theorem: The Beal s conjecture and prize problem, by Daniel Mauldin. [3]. http://en.wikipedia.org/wiki/diophantus [4]. http://en.wikipedia.org/wiki/fermat [5]. http://en.wikipedia.org/wiki/number-theory [6]: http://en.wikipedia.org/wiki/algebraic geometry 5 / 5