A beautifull day, i found a probablistic test for Mersenne Prime numbers. It is not a big deal but i would like to present it to you:
3^(2^p) = 9 mod Mp It follows directly from the little Fermat. It is easy and perhaps a little bit faster than the Lucas Lehmer Test. You need p times squaring and calculating mod Mp Nice greetings from the primes Bernhard Helmes -- www.devalco.de www.beablue.de Tel.: 0241 / 99 77 55 22 in Germany (0049) Ist Ihr Browser Vista-kompatibel? Jetzt die neuesten Browser-Versionen downloaden: http://www.gmx.net/de/go/browser _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
