Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫  π  -¹ ² ³ °

You are not logged in.

## #1 2016-03-15 15:06:37

Member
Registered: 2013-01-22
Posts: 131

### Mersenne Prime Theorem

For a mersenne prime............

, all possible prime factors will =
where n= prime and m=any multiple..........

This will definitely work because of Fermat's little theorem

is always factorable by p, if p is prime and the fact that the pattern of remainders repeats itself so remainder 1 =
and n=(p-1)/m, and p=mn+1!!!

Last edited by Primenumbers (2016-03-17 21:34:34)

"Time not important. Only life important." - The Fifth Element 1997

Offline

## #2 2016-03-16 05:11:36

Nehushtan
Member
Registered: 2013-03-09
Posts: 905
Website

### Re: Mersenne Prime Theorem

, all possible prime factors will =
where n= prime and m=any multiple..........

This is just another way of stating Fermat's little theorem, nothing new.

The statement is clearly true for n = 2.

If n is an odd prime then

Blog

Offline

## #3 2016-03-16 21:37:31

Member
Registered: 2013-01-22
Posts: 131

### Re: Mersenne Prime Theorem

I don't get it. Why would.................

Nehushtan wrote:

prove that all possible prime factors will =mn+1..........................?

Last edited by Primenumbers (2016-03-17 21:36:07)

"Time not important. Only life important." - The Fifth Element 1997

Offline

## #4 2016-04-23 21:39:55

googol
Member
From: Delft, The Netherlands
Registered: 2016-04-22
Posts: 13

### Re: Mersenne Prime Theorem

10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Offline