The Primal Enigma of Mersenne Primes By Irma Sheryl Crespo Proof and its examples, puzzle, and the overall presentation by Irma Crespo. Are Mersenne Primes.

Slides:



Advertisements
Similar presentations
Presented by Alex Atkins.  An integer p >= 2 is a prime if its only positive integer divisors are 1 and p.  Euclid proved that there are infinitely.
Advertisements

1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
Copyright © Cengage Learning. All rights reserved.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Prime Numbers: A Recent Discovery, Secure Communications, and Million Dollar Prizes George T. Gilbert TCU January 29, 2003.
7.1 Factors and Greatest Common Factors (GCF) CORD Math Mrs. Spitz Fall 2006.
Whiteboardmaths.com © 2004 All rights reserved
4.2 Factors and Divisibility
5.1 Number Theory. The study of numbers and their properties. The numbers we use to count are called the Natural Numbers or Counting Numbers.
The Fundamental Theorem of Arithmetic (2/12) Definition (which we all already know). A number greater than 1 is called prime if its only divisors are 1.
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.
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Copyright © Cengage Learning. All rights reserved.
Properties of the Integers: Mathematical Induction
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
prime numbers: facts and discoveries
Copyright © Cengage Learning. 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.
Section 5.1 Number Theory.
Greatest Common Factor
Slide 5-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
MATH 224 – Discrete Mathematics
1 Additional Support for Math99 Students By: Dilshad Akrayee.
§ 5.4 Factoring Trinomials.
HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2010 Hawkes Learning Systems. All rights reserved. Hawkes Learning Systems: College Algebra.
Chapter P Prerequisites: Fundamental Concepts of Algebra
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
Lesson 5.7.  Before machines and electronics were adapted to do multiplication, division, and raising a number to a power, scientists spent long hours.
Advance Data Structure and Algorithm COSC600 Dr. Yanggon Kim Chapter 1.
Shaping Modern Mathematics: The Queen of Mathematics Raymond Flood Gresham Professor of Geometry.
Chapter 4 Number Theory in Asia The Euclidean Algorithm The Chinese Remainder Theorem Linear Diophantine Equations Pell’s Equation in Brahmagupta Pell’s.
MATH 224 – Discrete Mathematics
SECTION 5-1 Prime and Composite Numbers Slide
What are factors? What makes a number prime or composite?
Factors: Divisibility Rules, Exponents, Prime Factorization and Greatest Common Factor (GCF) Mr. Martin.
© 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.
CompSci 102 Discrete Math for Computer Science
Computational Number Theory - traditional number theory Prime Numbers Factors Counting Factors D- functions.
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
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.
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
Copyright © Cengage Learning. All rights reserved. 1.5 Prime Factorization.
Math 409/409G History of Mathematics Books VII – IX of the Elements Part 3: Prime Numbers.
Of Polynomials. What is Factorization?  factorization or factoring is the decomposition of an object into a product of other objects, or factors, which.
Factorization of Polynomials. What is Factorization?  factorization or factoring is the decomposition of an object into a product of other objects, or.
P RIME N UMBERS. W HAT IS A P RIME N UMBER ? In mathematics, a prime number (or a prime) is a natural number which has exactly two distinct natural number.
Foundations of Discrete Mathematics Chapters 5 By Dr. Dalia M. Gil, Ph.D.
Math 409/409G History of Mathematics Perfect Numbers.
Copyright © Cengage Learning. All rights reserved. Fundamental Concepts of Algebra 1.1 Real Numbers.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
Slide Copyright © 2009 Pearson Education, Inc. 5.1 Number Theory.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Pretty Numbers Moloy De !. 6 6 is the smallest perfect number 1, 2 and 3 are the only proper positive divisors of 6 and = 6 6, 28, 496, and.
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!).
Section 5.1 Number Theory.
Handbook of Applied Cryptography - CH4, from 4.1~4.3
Chapter 5: Number Theory
Subject : Algebra Std - 9th Subject- Algebra Topic- Real Numbers.
Section 5.1 Number Theory.
Prime Factorization.
Section 5.1 Number Theory.
MATH TERMS Terms we need to know!.
Section 4.3 Prime Factorization and Greatest Common Divisor
Copyright © Cengage Learning. All rights reserved.
Presentation transcript:

The Primal Enigma of Mersenne Primes By Irma Sheryl Crespo Proof and its examples, puzzle, and the overall presentation by Irma Crespo. Are Mersenne Primes finite or infinite?

NEWSFLASH!!! ISCrespo 2008 ISCRESPO

44 th Mersenne Prime Discovered The new prime number is M or 2 32,582, with 9,808,358 digits. Nearly close to the coveted 10 million digits that has a $100,000 reward attach to it. Mersenne Primes are named from the digit to which two is raised. Therefore, the recently discovered number is M because two is raised to the power of 32,582,657. This newest member of Mersenne Primes was generated on September 4, 2006 by the Central Missouri State University team led by Dr. Cooper and Dr. Boone. ISCrespo 2008 ISCRESPO

But wait! What are Mersenne Primes??? ISCrespo 2008 ISCRESPO

All About Father Mersenne A 17 th century French mathematician and physicist. Jesuit educated and friar of the Order of Minims. Known as an effective clearinghouse of scientific information. He conjectured that M p of M n =2 p -1 was prime for p=2,3,5,7,13,17,19,31,67,127, and 257 and composite for all other primes p  257. This was subjected to challenges. Despite the intensive scrutiny on the above conjecture, his name was still attributed to Mersenne Primes. Mersenne Primes refer to prime numbers that are found by raising 2 to a certain power and subtracting one from the total ( 2 p -1) ISCrespo 2008 ISCRESPO

5 Errors on Mersenne’s Conjecture Pervusin (1883) and Seelhoff (1886) proved independently that M 61 was prime. (p=61 was not on Mersenne’s list) Cole (1903) discovered factors for M 67. It was composite. (p=67 was on Mersenne’s list for prime exponents) Powers (1911) found M 89 was prime. (p=89 was not on Mersenne’s list) Fauquembergue and Powers ( ) proved independently that M 107 was prime. (p=107 was not on Mersenne’s list) Kraitchik (1922) discovered that M 257 was composite. (p=257 was on Mersenne’s list for prime exponents) ISCrespo 2008 ISCRESPO

Errors Corrected By 1947 Mersenne's range, p < 257, had been completely checked and it was determined that the correct list is: p = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107 and 127. ISCrespo 2008 ISCRESPO

A Glance at Perfect Numbers Perfecting the Imperfect Mystical Property: There is divinity in perfect numbers. Definition: A positive integer n is said to be perfect if n is equal to the sum of all its positive divisors, not including n itself. Ex. 6 = Theorem: If 2 k -1 is prime (k > 1), then n = 2 k – 1 (2 k – 1) is a perfect number. Ex. If k = 3, then, =7, which is a prime. So, n = 2 3 – 1 (2 3 – 1) = 2 2 (7) =47=28: a perfect number. Lemma: If n = p 1 k 1 p 2 k 2 …p r k r is the prime factorization of the integer n >1, then the positive divisors of n are precisely those integers d of the form d = p 1 a 1 p 2 a 2 …p r a r, where 0  a i  k i (i = 1,2,…r). Ex. If n = 180, then, 180 = So, the positive divisors of 180 are integers of the form 2 a 1 3 a 2 5 a 3 where a 1 = 0,1,2; a 2 = 0,1,2; and a 3 =0,1 because 2 2 is 2 0,2 1,2 2 ; 3 2 is 3 0,3 1,3 2 ; and 5 1 is 5 0,5 1. ISCrespo 2008 ISCRESPO

Perfect Numbers and Mersenne Primes Relatively Related To recap, we’ll set k=p so that the perfect numbers are defined by 2 p – 1 (2 p – 1) while Mersenne Primes are defined by 2 p – 1. It is apparent from the given formulas that a known perfect number can be generated from a Mersenne prime. If 2 p – 1 describes a Mersenne prime, then the corresponding perfect number is equal to 2 p – 1 (2 p – 1) where p=2,3,5,7,13,17,19,31 or other Mersenne exponents. Obviously, 2 p – 1 (2 p – 1) will always be a perfect number whenever 2 p – 1 is a prime number. Contrary to primes, all perfect numbers are even and all perfect numbers end in 6 and 8 alternately. ISCrespo 2008 ISCRESPO

Where’s the proof? If M is a prime number equal to 2 p – 1, then we have to find the factors for 2 p – 1 (2 p – 1) or 2 p – 1 * M. The factors of 2 p – 1 are 1, 2, 4, 8, 16, 32, 64, up to 2 p-3, 2 p-2 and 2 p-1. The rest of the factors of the perfect number, 2 p – 1 (2 p – 1), are each of the already found factors multiplied by 2 p – 1. The sum of the factors of 2 p-1 is 1 *( 2 p -1). The sum of the factors of the perfect number (except the factor of the number itself) is (2 p-1 - 1) (2 p – 1). Adding both sums will result to 2 p – 1 (2 p – 1), the perfect number. Thus, 2 p – 1 (2 p – 1) is a perfect number whenever 2 p – 1 is a Mersenne prime. ISCrespo 2008 ISCRESPO

Table of the Factors ISCrespo 2008 Adding the Sums + The Perfect Number ISCRESPO

Example please… If M = 2 p – 1 and p=3 (one of Mersenne’s prime exponents) then, 2 3 – 1= 8 – 1=7, which is a prime number. The factors of 2 p – 1 = 2 3 – 1 = 2 2 = 4 are 1,2, and 4. The factors of 2 p – 1 (2 p – 1)= 2 3 – 1 (2 3 – 1) are 1M, 2M and 4M or 1(7),2(7), and 4(7). Adding the factors of 2 p – 1 = 2 3 – 1 : = 7 = M, a Mersenne Prime. Adding the factors of the perfect number 2 3 – 1 (2 3 – 1) except 4M or 4(7), we have 1(7) + 2(7) = 21. Putting together the sum of the factors of 2 3 – 1 and 2 3 – 1 (2 3 – 1): 7+21 = 28 = 2 3 – 1 (2 3 – 1), which is the perfect number. ISCrespo 2008 ISCRESPO

Prime or Composite? That is the question. ISCrespo 2008 ISCRESPO

The Lucas-Lehmer Test ISCrespo 2008 ISCRESPO

Lucas-Lehmer Code Made Simple by Wikipedia … ISCrespo 2008 ISCRESPO

Go over…just checking. ISCrespo 2008 ISCRESPO

Search for Mersenne’s P  ISCrespo 2008 ISCRESPO

Euclid’s Even Perfect : Euclid’s Even Perfect : 2 p – 1 (2 p – 1) Hint: Take the first four of Mersenne’s prime exponents & plug into the “perfect” formula. ISCrespo 2008 ISCRESPO

A Number Neither Prime Nor Composite ISCrespo 2008 ISCRESPO

The Final Answers ISCrespo 2008 ISCRESPO

Last Conundrum Since the 44 th Mersenne Prime is found, can we obtain the largest perfect number from it? How many known perfect numbers are there? Something to think about. It’s already out there and it’s close to 20 million digits! ISCrespo 2008 ISCRESPO

The Quest for Primes Continues! ISCrespo 2008 ISCRESPO

Are Mersenne Primes finite or infinite? The Primal Enigma of Mersenne Primes ISCrespo 2008 ISCRESPO

References BOOKS Burton, David M., History of Mathematics. New York:McGraw- Hill,2007. Fraleigh,John B., A First Course in Abstract Algebra. Boston: Pearson Education, WEBSITES ISCrespo 2008 ISCRESPO