Leonard Euler (1707-1783) 1723 Euler obtains Master's degree in philosophy for the University of Basel having compared and contrasted the philosophical.

Slides:



Advertisements
Similar presentations
Leonhard Euler Leonhard Euler was born in Basel, but the family moved to Riehen when he was one year old and it was in Riehen, not far from.
Advertisements

Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Sophie Germain ( ) Marie-Sophie Germain, studied independently using lecture notes for many courses from École Polytechnique. She was supported.
Having Proofs for Incorrectness
Induction and recursion
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.
Chapter 11 Polynomial Functions
CSE115/ENGR160 Discrete Mathematics 02/07/12
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(
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.
K. -C. Yang and J. -L. Lin National Tsing Hua University
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.
NUMERICAL METHODS WITH C++ PROGRAMMING
Mathematics Quadratic Formula Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.
Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Chapter 10 Infinite Series Early Results Power Series An Interpolation on Interpolation Summation of Series Fractional Power Series Generating Functions.
Number Theory Number Theory: A reflection of the basic mathematical endeavor. Exploration Of Patterns: Number theory abounds with patterns and requires.
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.
Mathematics Number: Logarithms Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
Discrete Mathematics, 1st Edition Kevin Ferland
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Chapter 4 Polynomials TSWBAT determine if an expression is a monomial, binomial, or polynomial; determine the degree of a monomial or polynomial; add and.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
Twenty Other Ideas Countdown of two dozen of Euler’s big ideas that don’t have his name on them.
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
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.
CSC201 Analysis and Design of Algorithms Asst.Proof.Dr.Surasak Mungsing Oct-151 Lecture 2: Definition of algorithm and Mathematical.
Chapter 11 The Number Theory Revival
1 Proof Strategies CS/APMA 202 Rosen section 3.1 Aaron Bloomfield.
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.
Leonhard Euler Elif Nur Esen
Mathematicians By: Ethan brown. Aryabhatta While Europe was in its early Dark Age, Aryabhatta advanced arithmetic, algebra, elementary analysis, and especially.
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.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
II Towards infinity ¥ Sequences: potential infinity (n) = 1, 2, 3,... (2 n ) = 1, 2, 4, 8,... The reciprocals of the terms of the sequence approach zero.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
PSAT MATHEMATICS 9-A Basic Arithmetic Concepts. Set A collection of “things” that have been grouped together in some way. “things” – elements or members.
In this section we develop general methods for finding power series representations. Suppose that f (x) is represented by a power series centered at.
Tuesday’s lecture: Today’s lecture: One-way permutations (OWPs)
Copyright © Cengage Learning. All rights reserved. Fundamental Concepts of Algebra 1.1 Real Numbers.
Mathematical Induction 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.
Week 3 - Friday.  What did we talk about last time?  Proving existential statements  Disproving universal statements  Proving universal statements.
Mathematical Induction
CS104:Discrete Structures Chapter 2: Proof Techniques.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Department of Statistics University of Rajshahi, Bangladesh
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 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.
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)
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
CSE15 Discrete Mathematics 02/08/17
“n = 2 is great, but the fun starts at n = 3”- Math
Proof methods We will discuss ten proof methods: Direct proofs
Advanced Algorithms Analysis and Design
Methods of Proof CS 202 Epp, chapter 3.
Predicate Calculus Validity
LESSON 5–4 Indirect Proof.
Induction and recursion
6.1 day 2 Euler’s Method Leonhard Euler made a huge number of contributions to mathematics, almost half after he was totally blind. (When this portrait.
Euler’s Method Leonhard Euler made a huge number of contributions to mathematics, almost half after he was totally blind. (When this portrait was made.
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Mathematical Induction
Topic Past Papers –Proofs
Advanced Analysis of Algorithms
Mathematical Induction
Presentation transcript:

Leonard Euler ( ) 1723 Euler obtains Master's degree in philosophy for the University of Basel having compared and contrasted the philosophical ideas of Descartes and Newton. Begins his study of theology completes his studies at the University First paper in print submitted an entry for the 1727 Grand Prize of the Paris Academy on the best arrangement of masts on a ship awarded 2 nd place awarded post in St. Petersburg also serving as a medical lieutenant in the Russian navy became professor of physics at the St. Petersburg Academy of Science promoted to senior chair of mathematics, when Bernoulli left and 1740 won the Grand Prize of the Paris Academy moved to the Berlin Academy of sciences on the invitation of Frederic the Great. During the twenty-five years spent in Berlin, Euler wrote around 380 articles 1766 Euler returned to St Petersburg after disputes with Frederic the Great Became totally blind. He produced almost half his work totally blind Died from a brain hemorrhage.

Leonard Euler ( ) Studied number theory stimulated by Goldbach and the Bernoullis had in that topic. 1729, Goldbach asked Euler about Fermat's conjecture that the numbers 2 n + 1 were always prime. if n is a power of 2. Euler verified this for n = 1, 2, 4, 8 and 16 and, by 1732 that the next case = is divisible by 641 and so is not prime. We owe to Euler the notation f(x) for a function (1734), e for the base of natural logs (1727), i for the square root of -1 (1777),  for pi,  for summation (1755), the notation for finite differences  y and  2 y and many others. Found a closed form for the sum of the infinite series  (2) =  (1/n 2 ). Moreover showed that  (4) =  4 /90,  (6) =  6 /945,  (8) =  8 /9450,  (10) =  10 /93555 and  (12) = 691  12 / And  (s) =  (1/ns) =  (1 - p -s )-1. Euler also gave the formula e ix = cos x + i sin x and ln(-1) =  i In 1736 Euler published Mechanica which provided a major advance in mechanics Also gave cases of n=3 (and n=4) for Fermat (with little mistakes), the Euler equation for of an inviscid incompressible fluid, investigating the theory of surfaces and curvature of surfaces, and much, much more …

Leonard Euler ( )

Euler’s Solution for Exponent Four He actually proves a little more: a 4 +b 4 =c 2 has no solutions. His proof from Elements of Algebra Thm: There are neither solutions to x 4 +y 4 =z 2 nor to x 4- y 4 =z 2 except if x=0 or y= We may assume x and y are relatively prime Outline of the strategy. Use infinite descent. I.e. from any solution produce a smaller solution. But there are no solutions for small numbers.

Leonard Euler’s :Elements of Algebra 205. The case x 4 +y 4 =z 2 (*) I.If x,y relatively prime, then (A) either both odd or (B) one is odd and the other is even. II. (A) is not possible: An odd square is of the form 4n+1 (If k=2m+1,k 2 =4(m 2 +m)+1). So the sum of two odd squares is of the form 4n+2. This means it is divisible by 2 and not by 4, so it is not a square. So the sum cannot be a square. But 4 th powers are also squares, so the equation cannot hold. III. (B) If (x,y,z) is a solution (x 2 ) 2 +(y 2 ) 2 =z 2, then there are p,q such that x 2 =p 2 -q 2 and y 2 =2pq. IV. Moreover, y is even and x is odd. Then p is odd and q is even. Proof: First since x 2 =p 2 -q 2, either p or q has to be odd and the other even. Also p cannot be even, since then p 2 -q 2 would be of the form 4n-1 or 4n+3 and cannot be a square. (If p=2k and q 2 =4m+1, the p 2 -q 2 =4(k 2 -m)-1). V.Now (x,q,p) is another Pythagorean triple x 2 =p 2 -q 2, so there are r, s s.t. p=r 2 +s 2, q=2rs, x=r 2 -s 2. VI.2pq=4rs(r 2 +s 2 )=y 2 so 4rs(r 2 +s 2 ) must be a square. Also r, s, and r 2 +s 2 have no common prime factors (why?). VII.If the statement of VI holds all the factors -r,s, r 2 +s 2 - must be squares (why?). So there are t, u such that r=t 2, s = u 2. Also r 2 +s 2 =t 4 +u 4 is a square and hence (t,u, (t 4 +u 4 ) 1/2 ) is a solution of (*). Since x 2 =p 2 -q 2 =(t 4 -u 4 ) 2, y=t 2 u 2 (t 4 -u 4 ) it follows that x,y>t,u. So that if (x,y) yields a solution we have another solution (t,u) which is smaller. VIII. Repeat step VII to obtain smaller and smaller. But there are no small solutions (except the ones with zeros). IX.But the smaller solutions from above are also non-zero. This yields a contradiction.

Euler and the case n=3 Consider x 3 +y 3 =z 3 with relative prime (x,y,z) 1.Exactly one of the integers is even. 2.Say z is even and so x,y odd. Then x+y=2p and x-y=2q are both even. 3.Factorize x 3 +y 3 =(x+y)(x 2 -xy+y 2 ). 4.Then by inserting x=p+q, y=p-q one finds that p,q have opposite parity are relatively prime and 2p(p 2 +3q 2 ) has to be a cube. 5.The same conclusion is also true if z is odd. 6.(A) 2p and (p 2 +3q 2 ) are relatively prime then they have to be cubes and Euler argues that there exist (a,b) such that p=a 3 -9ab 2, q=3a 2 b-3b 3. 7.Factor to obtain 2p=2a(a-3b)(a+3b) is a cube and show that the factors are relatively prime making them all cubes. Say 2a=  3,a-3b=  3,a+3b=  3. Then (  ) is a new smaller solution. 8.This also works in a variation if 2p and (p 2 +3q 2 ) are not relatively prime. The problem is in step 6. He does not show that this is the only way for (p 2 +3q 2 ) to be a cube.