Sophie Germain (1776-1831) Marie-Sophie Germain, studied independently using lecture notes for many courses from École Polytechnique. She was supported.

Slides:



Advertisements
Similar presentations
Chapter 8 Introduction to Number Theory. 2 Contents Prime Numbers Fermats and Eulers Theorems.
Advertisements

Introduction to Proofs
1 Lect. 12: Number Theory. Contents Prime and Relative Prime Numbers Modular Arithmetic Fermat’s and Euler’s Theorem Extended Euclid’s Algorithm.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
Computability and Complexity
Having Proofs for Incorrectness
Primality Testing Patrick Lee 12 July 2003 (updated on 13 July 2003)
Basic properties of the integers
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.
CMSC 250 Discrete Structures Number Theory. 20 June 2007Number Theory2 Exactly one car in the plant has color H( a ) := “ a has color”  x  Cars –H(
Congruence of Integers
Approaches to FLT In the early approaches to FLT several methods were used (See for instance the proof of Germain Theorem). 1.Infinite descent 2.Congruences.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Leonard Euler ( ) 1723 Euler obtains Master's degree in philosophy for the University of Basel having compared and contrasted the philosophical.
October 1, 2009Theory of Computation Lecture 8: Primitive Recursive Functions IV 1 Primitive Recursive Predicates Theorem 6.1: Let C be a PRC class. If.
Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.
ElGamal Public Key Cryptography CS 303 Alg. Number Theory & Cryptography Jeremy Johnson Taher ElGamal, "A Public-Key Cryptosystem and a Signature Scheme.
Proof of Euler-Fermat (2/28) Here’s an outline of the proof of the Euler-Fermat Theorem, which mirrors the proof of flt. Given any m, let B = {b i | 0.
Great Theoretical Ideas in Computer Science.
(CSC 102) Discrete Structures Lecture 10.
Mathematics of Cryptography Part I: Modular Arithmetic
Module :MA3036NI Cryptography and Number Theory Lecture Week 7
By: Hector L Contreras SSGT / USMC
Introduction to Proofs
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Prelude to Public-Key Cryptography Rocky K. C. Chang, February
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.
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.
Chinese Remainder Theorem Dec 29 Picture from ………………………
MA/CSSE 473 Day 08 Extended Euclid's Algorithm Modular Division Fermat's little theorem.
Tuesday’s lecture: Today’s lecture: One-way permutations (OWPs)
Great Theoretical Ideas in Computer Science for Some.
Great Theoretical Ideas in Computer Science.
Direct Proof and Counterexample III
 Sophie Germain  Mathematician, physicist, and philosopher.  Born April 1, 1776, in Rue Saint-Denis, Paris, France  Died: June 27, 1831  Got educated.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Presented by: Katie Neville Underrepresented Mathematician: Sophie Germain.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas In Computer Science COMPSCI 102 Fall 2010 Lecture 16October 27, 2010Duke University Modular Arithmetic and the RSA Cryptosystem.
Great Theoretical Ideas in Computer Science.
Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.
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.
Cryptography Lecture 14 Arpita Patra © Arpita Patra.
Divisibility and Modular Arithmetic
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Great Theoretical Ideas in Computer Science.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
The Foundations: Logic and Proofs
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem For each of the following values of n and d, find integers q.
Chapter 00 – Number Q1 0 < x < 1 0 < x2 < x Option D.
Direct Proof and Counterexample III: Divisibility
“n = 2 is great, but the fun starts at n = 3”- Math
Great Theoretical Ideas in Computer Science
Advanced Algorithms Analysis and Design
Advanced Algorithms Analysis and Design
Number Theory (Chapter 7)
Study Guide State Fermat’s Last Theorem.
Copyright © Cengage Learning. All rights reserved.
Great Theoretical Ideas in Computer Science
PROOF BY CONTRADICTION
Great Theoretical Ideas in Computer Science
Direct Proof and Counterexample I
Kim Correll Holly Bochsler
Clements MAΘ October 30th, 2014
Lecture 3 Strings and Things (Section 1.1)
Lecture 2-3 Basic Number Theory and Algebra
Presentation transcript:

Sophie Germain ( ) Marie-Sophie Germain, studied independently using lecture notes for many courses from École Polytechnique. She was supported by her parents She used the pseudonym M. LeBlanc Corresponded with Lagrange who found out she was a woman and supported her. He also put several discoveries of hers as a supplement in his book Essai sur le Théorie des Nombres. Corresponded with Gauss who had high esteem for her work in number theory. Most famous result on the elasticity of surfaces to explain Chladni figures, for which she was awarded a prize. Also worked on FLT; a letter to Gauss in 1819 outlines her strategy. Sophie Germain’s Theorem was published in a footnote of Legedre’s 1827 Memoir in which he proves FLT for n=5.

Congruences Let p be a prime. For the residues modulo p there is addition, subtraction, multiplication and division. If a=kp+r we write a  r mod p, or a  r (p). Notice that if a=kp+r and b=lp+s, then a+b  r+s mod p. Also -r  p-r mod p, since if a=kp-r=(k-1)p+(p-r) and b=lp+r, then a+b  (k+l)p  0 mod p. Likewise we can multiply residues. Notice that since p is a prime, if rs  0 (p) then rs=kp and either r  0 (p) or s  0 (p). This means that we can invert multiplication to division.

Sophie Germain’s Theorem FLT I: x p + y p = z p has no integer solutions for which x, y, and z are relatively prime to p, i.e. in which none of x, y, and z are divisible by p; FLT II: x p + y p = z p has no integer solutions for which one and only one of the three numbers is divisible by p. Sophie Germain's Theorem: Let p be an odd prime. If there is an auxiliary prime  with the properties that 1.x p = p mod  is impossible for any value of x 2.the equation r’= r+1 mod  cannot be satisfied for any p th powers then Case I of Fermat's Last Theorem is true for p.

Sophie Germain’s Theorem Basic Lemma: If the condition 2 holds then x p + y p = z p implies that x = 0 mod , or y = 0 mod , or z = 0 mod  Proof: If the equation would hold, and say x is not 0 mod , we can multiply by a p where a is the inverse of x mod . Then 1+(ay) p  (az) p gives consecutive p th powers. Proof of Theorem: Step 1: Factorize x p +y p =(x+y)f(x,y) with f(x,y)= x p-1 -x p-2 y+x p-3 y 2 -….+y p-1 then (x+y) and f(x,y) are relatively prime. Assume this is not the case and q is a common prime divisor, then y=-x+kq and by substituting f(x,y)=px p-1 +rq. If p is divisible by q then p=q and x,y,z all are divisible by p which is a contradiction to the assumption. So x must be divisible by q and hence y. But x,y are coprime, so we get a contradiction.

Sophie Germain’s Theorem Step 2: By unique factorization x+y and f(x,y) both have to be p th powers. –Set x+y=l p and f(x,y)=r p, so z=lr. –In the same way one gets equations z-y=h p and z-x=v p Step 3: By the Basic Lemma either x,y or z is a multiple of . Say z  0 mod  Then l p +h p +v p =2z  0 mod  Also one of the l,h,v has to be divisible by . (Same argument as in the Lemma). Step 4: Since we are looking for primitive solutions only l can be divisible by . If h would be then  would be a common factor of z and y. and if v where then  would be a common factor of x and z. So x+y=l p  0 mod  so  x  -y mod  and r p  px p-1  p(-v p ) p-1  pv p(p-1) mod  so p  (r/v p-1 ) p mod , which contradicts the assumption 1.