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

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**Primenumbers****Member**- Registered: 2013-01-22
- Posts: 131

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

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

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

Offline

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

**226** books currently added on Goodreads

Offline

**Primenumbers****Member**- Registered: 2013-01-22
- Posts: 131

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

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

**10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000**

Offline

Pages: **1**