Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.

Slides:



Advertisements
Similar presentations
Fermat’s Last Theorem Dr. S. Lawrence ©2005.
Advertisements

Copyright © Cengage Learning. All rights reserved.
Introduction to Proofs
Proving Fermat’s last theorem FLT and lessons on the nature and practice of mathematics.
Fermat’s Last Theorem by Kelly Oakes. Pierre de Fermat (1601 – 1665) Born in Beaumont-de-Lomagne, 36 miles north- west of Toulouse, in France. He was.
Sophie Germain ( ) Marie-Sophie Germain, studied independently using lecture notes for many courses from École Polytechnique. She was supported.
Whiteboardmaths.com © 2004 All rights reserved
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
CSE115/ENGR160 Discrete Mathematics 02/07/12
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
Inverses and GCDs Supplementary Notes Prepared by Raymond Wong
Complexity1 Pratt’s Theorem Proved. Complexity2 Introduction So far, we’ve reduced proving PRIMES  NP to proving a number theory claim. This is our next.
Number Theory: Fermat’s Last Theorem Fermat’s last conjecture/Wiles’ Theorem: For n>2 the equation x n +y n =z n has no solutions in terms of non-zero.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Methods of Proof Lecture 4: Sep 16 (chapter 3 of the book)
Math 409/409G History of Mathematics Pythagorean Triples.
Fermat’s Last Theorem: Journey to the Center of Mathematical Genius (and Excess) Rod Sanjabi.
Fermat’s Last Theorem By: Andy Smith. Fermat’s Professional life Lived Law school Councilor at the parliament of the French city of Toulouse.
A GENERALIZATION OF FERMAT’S LAST THEOREM BY ALHAJI ALKALI* AND G. U. GARBA DEPARTMENT OF MATHEMATICS AHMADU BELLO UNIVERSITY, ZARIA A PAPER PRESENTED.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
Chapter 3 Greek Number Theory The Role of Number Theory Polygonal, Prime and Perfect Numbers The Euclidean Algorithm Pell’s Equation The Chord and Tangent.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Methods of Proof & Proof Strategies
Modular Arithmetic.
Introduction to Proofs
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
Introduction to Proofs
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Fermat’s Last Theorem??. Who was Fermat? Born in France Became city councilor in Toulouse Then he became a judge Had a reputation for being distracted.
Whiteboardmaths.com © 2004 All rights reserved
Chapter 11 The Number Theory Revival
Chapter 5 Existence and Proof by contradiction
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Mathematical Problems & Inquiry in Mathematics AME Tenth Anniversary Meeting May A/P Peter Pang Department of Mathematics and University Scholars.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Activity 1-13: Descent This problem is due to Euler. Task: Show that the equation x 3 + 2y 3 + 4z 3 = 0 has the sole solution (0,
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
MATHEMATICAL INNOVATIONS Balakumar R “While pursuing a single problem through the centuries “
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
Section 1.8. Proof by Cases Example: Let b = max{a, b} = a if a ≥ b, otherwise b = max{a, b} = b. Show that for all real numbers a, b, c
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
The Foundations: Logic and Proofs
CS 2210:0001 Discrete Structures Logic and Proof
CSE15 Discrete Mathematics 02/01/17
CSE15 Discrete Mathematics 02/08/17
“n = 2 is great, but the fun starts at n = 3”- Math
Indirect Argument: Two Classical Theorems
The Number Theory Revival
Predicate Calculus Validity
The Foundations: Logic and Proofs
CSE 311: Foundations of Computing
CS 220: Discrete Structures and their Applications
CS 220: Discrete Structures and their Applications
First Order Logic Rosen Lecture 3: Sept 11, 12.
Methods of Proof Rosen 1.7, 1.8 Lecture 4: Sept 24, 25.
Methods of Proof Rosen 1.7, 1.8 Lecture 4: Sept, 2019.
Presentation transcript:

Fermat’s Last Theorem Samina Saleem Math5400

Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem which became one of the most challenging problems in mathematics.The theorem states that: “The equation x n + y n = z n has no non zero integer solutions for x, y and z when where n is an integer.” In the margin of a mathematics book that Fermat read, he wrote down: “I have a truly marvelous demonstration of this proposition which this margin is too narrow to contain. “

Although x 2 + y 2 = z 2 has an infinite number of solutions,but x n + y n = z n has no nontrivial whole number solutions for n > 2. For example, we can easily check to see that = 5 2 and = Try as you may you cannot come up with integer values for x, y, and z such that x 3 + y 3 = z 3.

Proofs for special cases  Fermat has given the proof for n=4  He tried to prove that the area of a right triangle with rational sides is never a perfect square, a condition that is equivalent to the claim that there are no integer solutions to x 4 + y 4 = z 2 and hence no solutions to x 4 + y 4 = z 4

Fermat's Proof for n=4  Fermat studied the following equation x 4 + y 4 = z 2 and showed that this equation has no solution in integers all different from zero.

Continued... Suppose x 4 + y 4 = z 2 has solution. Let (x,y, z) be a positive integers such that x 4 + y 4 = z 2 then g.c.d (x,y)=1 Assume p divides x and y then x=pk and y=pk ' Then p|x and p|y p| x 4, p| y 4 p|( x 4 + y 4 ) it proves p| z 2 Now Let x=px' and y=py ' then x 4 + y 4 = p 4 x ' 4 + p 4 y ' 4 = p 4 (x ' 4 +y ' 4 )= p 4 z ' 2 and therefore x ' 4 + y ' 4 = z ' 2

Continued……..  We assumed that x is the smallest number for which the equation holds. Now found  0<x'<x and the equation holds for x' which is a contradiction. Hence Equation has no solutions. Fermat further connected the above results by a corollary to prove that x 4 + y 4 = z 4 has no solution in integers, all different from zero

Euler Proof for n=3 Assume that x, y, z are non zero pair wise relatively prime and |z| is the smallest possible. x+ y=2u x - y=2u 2x=2(u+v) X=u+ v 2y=2(u-v) y=u- v (-z 3 )= x 3 + y 3 =(u+ v) 3 + (u - v) 3 =2 u 3 +6u v 2 =2u(u 2 +3 v 2 )

Continued……  It implies that (-z 3 )= 2u(u 2 +3 v 2 ) where u 2 +3 v 2 is odd and z is even. Therefore g.c.d(2u, u 2 +3 v 2 ) =1 when u is not divisible by 3 =3 when u is divisible by 3

Continued….. Now if g.c.d(2u,u 2 +3 v 2 ) =1 then by unique factorization theorem 2u,and u 2 +3 v 2 are cubes. That is 2u= a 3 and u 2 +3 v 2 = b 3 According to key lemma we can write u=c 3 -9cd 2 and v=3 c 2 d-3 d 2 This is where the Euler’s had the gap.

Now if we consider key lemma of this theorem then d is odd and c is even since v is odd then a 3 =2u =2c(c-3d)(c+3d). Now because the three factors on the right hand side are pairwise coprime they must all be a three power. 2c= -n 3, c-3d= l 3 c+3d= m 3 Where l, m, n are distinct and pairwise relatively prime. therefore we conclude that n 3 + l 3 + m 3 =0,but |z |> |m | because | z 3 |= |2u(u 2 +3 v 2 )|= | n 3 (c 2 9 d 2 ) (u 2 +3 v 2 )|≥ | n 3 | Because c d 2 = l 3 m 3 ≠0 and v≠0 since it is odd contradicts the minimality of Z. A contradiction

Infinite descent method  This method is known as method of “infinite descent” created by Fermat in which you assume that you have the smallest solution for a problem and show that there exist still smaller solutions.  In other words there is no smallest solution and if you continue working on it there is no solution at all. Although Fermat proved the theorem for n=4 by using the “infinite descent” method, this method doesn’t work for values n>4.

Sophie Germain  In early 1800’s a French Mathematician Sophie Germain adopted a new strategy to approach FLT According to Sophie Germain if n and 2n+1 are primes then x n + y n = z n implies that one of x, y, and z is divisible by n. Hence Fermat’s last theorem could be broken into two cases.  Case I: none of x y, z is divisible by n  Case II: one and only one of x, y, z is divisible by n.  She has proved the theorem for Sophie Germain primes <100

Further History  In 1825,Legendre had followed the Sophie Germain's criterion, and proved the first case of Fermat’s last theorem holds for every prime p<197 He was also able to proof second case.  In 1832 Peter Lejenue-Dirichlet proved the theorem for n=14.  In 1839 Gabriel Lame proved the result for n=7.  Specific cases are proven in 1909, 1915, and But still no one is able to come up with the complete proof to FLT.

 In September 1955, a 28-year-old Japanese mathematician, Taniyama – Shimura claimed that all elliptical curves are modular.  In 1985 Gerhard Frey a German mathematician considered the unthinkable. What would happen if Fermat was wrong and there was a solution to this equation? Frey’s idea became known as the epsilon conjecture.

Frey showed how starting with a fictitious solution to Fermat ’ s last equation could make an elliptic curve with some very weird properties. That elliptic curve seemed to be not modular. But Taniyama – Shimura said that every elliptic curve is modular.

So it means if there is a solution to this equation it creates such a wired elliptic curve it defies Taniyama – Shimura. In other words if Fermat is false so did the Taniyama – Shimura or if Tanyama Shimura is correct then Fermat ’ s last theorem is also true. In fact, Frey was the first mathematician who built the bridge between Taniyama – Shimura conjecture and Fermat ’ s last theorem.

 Ken Ribet, a professor at University of California, with the help of Barry Mazur, later proved this result. Now FLT is linked to the Taniyama–Shimura conjecture.  In June 1993, Andrew Wiles has proved FLT.  In September 1993 an error has been found.  On September 19, 1994 Andrew wiles resolved the problem with his former student and Fermat ’ s last theorem has been proved.

Curriculum link  Principles of Mathematics, Grade 10, Academic (MPM2D), Foundations of Mathematics, Grade 10, Applied (MFM2P) solve problems involving right triangles, using the primary trigonometric ratios and the Pythagorean theorem;  Functions and Relations, Grade 11, University Preparation  Connecting Algebra and Geometry. In the Investigations of Loci and Conics strand, students will extend their inquiry of loci into a study of conics.

Use in Teaching Mathematics  The Story  The video  Activities  hers/activities/2414_proof.html hers/activities/2414_proof.html  hers/ideas/2414_proof.html hers/ideas/2414_proof.html