Mersenne Prime Theorem

Primenumbers · 2016-03-15 15:06:37

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)

Nehushtan · 2016-03-16 05:11:36

Primenumbers wrote:

, 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

[list=*]
[*]

[/*]
[/list]

Primenumbers · 2016-03-16 21:37:31

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)

googol · 2016-04-23 21:39:55

Math Is Fun Forum