Dear Hogranch, 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 Merseeene 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. Could I still win all the prizes totaling $400,000 if I use my own sequence and prove that some of its large terms are prime numbers? If I generate and prove that one of its terms that's greater than 10 to the 9th power, will I only win $250,000 or will I also win the other $250,000 prizes because the prime is larger than those required for the lessor prizes? If I wouldn't win the other prizes then I wait until I've found numbers of the sequence that exceed each of the lessor requirements because my proof of my proffered prime number would enable others to generate and test those numbers and possibly win the other prizes before I'm ready. I believe that it may be relatively easy for me to find a prime number exceeding 10 to the 12th power with my sequence and testing that proves that a give member of the sequence is prime. You may respond via e-mail or call 7-days a week toll free 888-588-9542 between 8AM and 11:45PM Pacific Time. Best regards, George S. Louis, CEO Digital Systems & Solutions _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
