Talk:Mersenne prime
Data on factor types
Can be gotten from prime pages they have the proof.
Sieving small prime factors
Before learning how to use polynomial remainder theorem they sieved to 40,000 for each candidate factor, afterwards I think that jumped to 40,000,000
additional restrictions that could be added to prime factors
They also need to be prime for least factors, that means since ![\[(2kp+1)(2jp+1)=2(2jkp+k+j)p+1\]](http://latex.artofproblemsolving.com/3/4/6/34607f9c46c17a76777a6776e2b355e22a52fa01.png)
we can sieve of sundaram within them...
