Dear [email protected] I've developed a recursive infinite sequence that includes many prime numbers and gets larger much faster than the Mersenne number sequence. It's not related to the Merseene numbers. Because of it nature it's much easier to test and prove that a give number of the sequence is a prime than it is to prove those of the Merseene number sequence are prime, i.e. much less computing power. There's a total of $500,000 prize money for generating prime numbers of 10,000,000 or more digits. Please see <http://www.mersenne.org/prize.htm> for a detailed description of the prizes.
You may respond via e-mail or call 7-days a week 619-401-9876 or toll free 888-588-9542 between 8AM and 11:45PM Pacific Time. Best regards, George S. Louis, CEO Digital Systems & Solutions 1573 Kimberly Woods Drive El Cajon, CA 92020-7261 _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
