Perfect Numbers (3/26) Definition. A number is called perfect if it is equal to the sum of its proper divisors. Examples: 6 and 28 are the first two (check!).

Slides:



Advertisements
Similar presentations
What is the sum of the following infinite series 1+x+x2+x3+…xn… where 0
Advertisements

Daily Check Find the first 3 terms of the following sequence:
Copyright © Cengage Learning. All rights reserved.
Even and Odd Permutations (10/2) Theorem. Every cycle, and hence every permutation, can be written as product of (usually non-disjoint) 2-cycles. Example.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.
Fermat’s Little Theorem (2/24) Theorem (flt). If p is prime and GCD(a, p) = 1, then a p – 1  1 (mod p). Again, this says that in a mod p congruence, we.
Quotient-Remainder Theory, Div and Mod
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
CN College Algebra Ch. 11: Sequences 11.3: Geometric Sequences Goals: Determine if a sequence is geometric. Find a formula for a geometric sequence. Find.
Arithmetic Sequences and Series Unit Definition Arithmetic Sequences – A sequence in which the difference between successive terms is a constant.
Elementary Number Theory and Methods of Proof. Basic Definitions An integer n is an even number if there exists an integer k such that n = 2k. An integer.
Series (i.e., Sums) (3/22/06) As we have seen in many examples, the definite integral represents summing infinitely many quantities which are each infinitely.
Polygonal, Prime and Perfect Numbers
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 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
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.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
Powerpoint Templates Page 1 Powerpoint Templates Mathematics & Proofs.
SECTION 5-3 Selected Topics from Number Theory Slide
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.
Structures 5 Number Theory What is number theory?
Sequences and Series (T) Students will know the form of an Arithmetic sequence.  Arithmetic Sequence: There exists a common difference (d) between each.
Sequences and Series A sequence is an ordered list of numbers where each term is obtained according to a fixed rule. A series, or progression, is a sum.
Intro to Infinite Series Geometric Series
External Direct Products (11/4) Definition. If G 1, G 2,..., G n are groups, then their external direct product G 1  G 2 ...  G n is simply the set.
© T Madas. A prime number or simply a prime, is a number with exactly two factors. These two factors are always the number 1 and the prime number itself.
Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
By MUHAMMAD YUSRAN BASRI MATH ICP B Many early writers felt that the numbers of the form 2 n -1 were prime for all primes n, but in 1536 Hudalricus.
12 INFINITE SEQUENCES AND SERIES. In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series.
Section 8.2: Infinite Series. Zeno’s Paradox Can you add infinitely many numbers ?? You can’t actually get anywhere because you always have to cover half.
Cosets and Lagrange’s Theorem (10/28)
Multiplication Facts X 3 = 2. 8 x 4 = 3. 7 x 2 =
Math 409/409G History of Mathematics Perfect Numbers.
Solve each equation and check the solution. 08 September 2015 Warm-Up.
Prime Numbers (3/17 ) We all know what a prime number is. Theorem (Euclid). There are infinitely many primes. Euclid’s original proof idea can be stated.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
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.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
12. Section 10.2 Summing an Infinite Series Continued.
Chapter 7 Infinite Series. 7.6 Expand a function into the sine series and cosine series 3 The Fourier series of a function of period 2l 1 The Fourier.
INFINITE SEQUENCES AND SERIES In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series and.
SECTION 8.3 THE INTEGRAL AND COMPARISON TESTS. P2P28.3 INFINITE SEQUENCES AND SERIES  In general, it is difficult to find the exact sum of a series.
Section 5.1 Number Theory.
Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]
The Forgiveness Method & Partial Quotients Division
Chapter 5: Number Theory
Induction and recursion
Clicker Question 1 The series A. converges absolutely.
Perfect numbers.
Administrivia Syllabus and other course information posted on the internet: links on blackboard & at Check assignment sheet for reading.
Section 5.1 Number Theory.
Infinite Geometric Series
Polynomials and Polynomial Functions
Let Maths take you Further…
Clicker Question 1 The shortest interval which the Integral Test guarantees us will contain the value of is: A. 0 to 1 B. 0 to ½ C.
Prime and Relatively Prime Numbers
PRIME FACTORS.
Section 5.1 Number Theory.
Edexcel Further Pure 2 Chapter 2 – Series:
Induction and recursion
5.5 Properties of the Definite Integral
Find the sum of , if it exists.
Applications of Taylor Series
FM Series.
Any combination of the prime factorization.
Warm Up Write the first 4 terms of each sequence:
Presentation transcript:

Perfect Numbers (3/26) Definition. A number is called perfect if it is equal to the sum of its proper divisors. Examples: 6 and 28 are the first two (check!). Question. Are there infinitely many? Answer. Unknown. Question. Is there some “machine”, i.e., formula, which will crank out at least some perfect numbers? Answer. Yes, Euclid strikes again! Euclid’s Theorem on Perfect Numbers. If both p and q = 2 p – 1 are prime (i.e., q is a Mersenne prime), then 2 p – 1 (2 p – 1) = 2 p – 1 q is a perfect number.

Examples and Proof of the Theorem In the theorem, set p = 2. Then q = 3 and we get 2(3) = 6. Now set p = 3. Then q = 7 and we get 2 2 (7) = 28. So what does p = 5 generate? Remember, we must check that q = 2 p – 1 is in fact a Mersenne prime. Proof outline: Because q is prime, the proper divisors of 2 p – 1 q are: 1, 2, 4,..., 2 p – 1 ; q, 2q, 4q,..., 2 p – 2 q. By (again!) the summing of a geometric series, the sum of the first half above is 2 p – 1 = q, and the sum of the second half is q(2 p – 1 – 1). Now add those up! QED!

Other Perfect Numbers? Question. Is every perfect number of this form? Answer. Not known, but “sort of”, in the following sense: First, no one has ever found an odd perfect number, but also no one has ever proved that they can’t exist. That aside, however, Euler settles the matter: Euler’s Theorem on Perfect Numbers. Every even perfect number is of the form 2 p – 1 (2 p – 1) where p and 2 p – 1 are prime. The proof is, as you might expect, not simple.

The sigma Function We define a new number theory function, the sigma function  (n). It is the sum of all the divisors of n (including 1 and n). Keep this straight from the Euler-Phi function. (What’s it measuring again?) Hence n is perfect if and only if  (n) = 2n. Facts about this function: If p is prime, then  (p k ) = 1 + p p k = (p k +1 – 1)/(p – 1) The sigma function is multiplicative (recall this term!). Example. What’s  (300)?

Assignment for Friday Read Chapter 15 through page 105 (further if you like). Do Exercises15.2, 15.3 a & b, and 15.5