### Present Remotely

Send the link below via email or IM

• Invited audience members will follow you as you navigate and present
• People invited to a presentation do not need a Prezi account
• This link expires 10 minutes after you close the presentation

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

# Mersenne Primes

Brief history and mathematical discovery
by

## Joseph Fryer

on 2 December 2010

Report abuse

#### Transcript of Mersenne Primes

Marin Mersenne (1588-1648):
-French Monk
-Mentor to young researchers
-Intrigued by perfect numbers
-Famous conjecture 1644 What are Mersenne Primes? Euclid's Formula to find
a perfect number:

If 2^(k)-1 is prime for k>1, then
n= 2^(k-1)(2^(k)-1) is a perfect number

Using Euclid's formula, Mersenne was aware that in order for 2^(k)-1 to be prime, k must also be prime.
Mersenne found prime numbers (k) that made 2^(k)-1 prime, these became known as Mersenne primes

Mersenne's conjecture: M prime for
k=2,3,5,7,13,17,19,31,67,127,257 Mersenne Primes
& Technology GIMPS Largest known prime (to date)
2^(24036583)-1
*seven million digits!
Full transcript