Chapter 11 The Number Theory Revival

Slides:



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

Mathematical Induction
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.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.
Fermat’s Theorems Raymond Flood Gresham Professor of Geometry.
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.
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.
Set, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.
Math 409/409G History of Mathematics Pythagorean Triples.
Copyright © 2007 Pearson Education, Inc. Slide R-1.
Properties of the Integers: Mathematical Induction
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
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.
Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.
BY RICKY LIU Fermat’s The last theorem, his proof and the author of the proof.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
1 1.0 Students solve equations and inequalities involving absolute value. Algebra 2 Standards.
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.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall. Chapter 11 Factoring Polynomials.
1 © 2010 Pearson Education, Inc. All rights reserved 10.1 DEFINITION OF A SEQUENCE An infinite sequence is a function whose domain is the set of positive.
Security in Computing Chapter 12, Cryptography Explained Part 3
Section 4.3: Fermat’s Little Theorem Practice HW (not to hand in) From Barr Text p. 284 # 1, 2.
Copyright © Cengage Learning. All rights reserved.
Polynomials and Polynomial Functions
The Binomial Theorem.
Discrete Mathematics, 1st Edition Kevin Ferland
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
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!
Chapter 4 Number Theory in Asia The Euclidean Algorithm The Chinese Remainder Theorem Linear Diophantine Equations Pell’s Equation in Brahmagupta Pell’s.
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.
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.
Notes 9.2 – The Binomial Theorem. I. Alternate Notation A.) Permutations – None B.) Combinations -
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.
Math Team Skills for March Rounds. Round 1 – Alg 2: Simultaneous Equations and Determinants The determinant of a 2x2 matrix is determined using a formula.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
11.1 – Pascal’s Triangle and the Binomial Theorem
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Quit Pierre de Fermat Fermat’s Last Conjecture Prime Numbers Euler’s Conjecture.
Chinese Remainder Theorem Dec 29 Picture from ………………………
Mathematics.
Network and Computer Security (CS 475) Modular Arithmetic
1 Section Congruences In short, a congruence relation is an equivalence relation on the carrier of an algebra such that the operations of the algebra.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
MATHEMATICAL INNOVATIONS Balakumar R “While pursuing a single problem through the centuries “
CS104:Discrete Structures Chapter 2: Proof Techniques.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Section 6.4. Powers of Binomial Expressions Definition: A binomial expression is the sum of two terms, such as x + y. (More generally, these terms can.
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.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Binomial Coefficients and Identities
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)
Lecture 34 Section 6.7 Wed, Mar 28, 2007
Copyright © 2004 Pearson Education, Inc.. Chapter 7 Further Topics in Algebra.
Direct Proof and Counterexample III: Divisibility
The Binomial Theorem Ms.M.M.
The Number Theory Revival
Chapter 4 Number Theory in Asia
CS 220: Discrete Structures and their Applications
4.3 Solving Quadratic Equations by Factoring
Elementary Number Theory & Proofs
Today we will Finish chapter 5
Chapter 11: Further Topics in Algebra
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Lecture 5 Number Theory & Proof Methods
Mathematical Induction
14.6 Triple Integrals Seventeenth-Century French mathematician Pierre de Fermat wrote in the margin of his copy of Arithmetica by Diophantus, near the.
Presentation transcript:

Chapter 11 The Number Theory Revival Between Diophantus and Fermat Fermat’s Little Theorem Fermat’s Last Theorem

11.1 Between Diophantus and Fermat China, Middle Ages (11th -13th centuries) Chinese Remainder Theorem Pascal’s triangle Levi ben Gershon (1321) “combinatorics and mathematical induction” (formulas for permutations and combinations) Blaise Pascal (1654) unified the algebraic and combinatorial approaches to “Pascal’s triangle”

Pascal’s triangle in Chinese mathematics The Chinese used Pascal’s triangle to find the coefficients of (a+b)n

Pascal’s Triangle

As we know now, the kth element of nth row is since Thus Pascal’s triangle expresses the following property of binomial coefficients:

Indeed, suppose that for all n we have Then Letting k = j + 1 in the second sum we get Knowing that C0n-1=1, Cn-1n-1 =1 and replacing j by k in the first sum we obtain

Combinations, permutations, and mathematical induction Levi ben Gershon (1321) gave the formula for the number of combinations of n things taken k at a time: He also pointed out that the number of permutations of n elements is n! The method he used to show these formulas is very close to mathematical induction

Why “Pascal’s Triangle” ? Pascal demonstrated (1654) that the elements of this triangle can be interpreted in two ways: algebraically as binomial coefficients combinatorially as the number of combinations of n things taken k at a time As application he solved problem of division of stakes and founded the mathematical theory of probabilities

Pierre de Fermat Born: 1601 in Beaumont (near Toulouse, France) Died: 1665 in Castres (France)

11.2 Fermat’s Little Theorem Theorem (Fermat, 1640) If p is prime and n is relatively prime to p (i.e. gcd (n,p)=1) then np – 1 ≡ 1 mod p Equivalently, np-1 – 1 is divisible by p if gcd (n,p)=1 or np – n is divisible by p (always) Note: Fermat’s Little Theorem turned out to be very important for practical applications – it is an important part in the design of RSA code! Fermat was interested in the expressions of the form 2m – 1 (in connection with perfect numbers) and, at the same time, he was investigating binomial coefficients Fermat’s original proof of the theorem is unknown

Proof Proof can be conducted in two alternative ways: iterated use of binomial theorem application of the following multinomial theorem:

11.3 Fermat’s Last Theorem “On the other hand, it is impossible for a cube to be written as a sum of two cubes or a fourth power to be written as a sum of two fourth powers or, in general, for any number which is a power higher than second to be written as a sum of two like powers. I have a truly marvellous demonstration of this proposition which this margin is too small to contain.” written by Fermat in the margin of his copy of Bachet’s translation of Diophantus’ “Arithmetica”

Theorem There are no triples (a,b,c) of positive integers such that an + bn = cn where n > 2 is an integer Proofs for special cases: Fermat for n = 4 Euler for n = 3 Legendre and Dirichlet for n = 5, Lame for n = 7 Kummer for all prime n < 100 except 37, 59, 67 Note: it is sufficient to prove theorem for all prime exponents (except 2) and for n = 4, since if n = mp where p is prime and an + bn = cn then (am)p + (bm)p = (cm)p

First significant step (after Kummer): Proof of Mordell’s conjecture (1922) about algebraic curves given by Falting (1983) Applied to the “Fermat curve” xn + yn = 1 for n > 3, this conjecture provides the following statement Fermat curve contains at most finitely many of rational points for each n > 3 Therefore, Falting’s result imply that equation an + bn = cn can have at most finitely many solutions for each n > 3 The complete proof of Fermat’s Last Theorem is due to Andrew Wiles and follows from much more general statement (first announcement in 1993, gap found, filled in 1994, complete proof published in 1995)