George Louis wrote:
> Dear mathematicians,
>
> Is anyone interested in the following:
>
> 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 $500,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
Umm, 10 to the 9th power is actually pretty small. The primes that
are being found these days are getting close to 10 to the 10 millionth
power. The latest Mersenne prime I've heard about has 9.8 million
digits. As to whether you could get some money, you'd have to read the
details of each contest.
> You may respond via e-mail or call 7-days a week toll free
> 888-588-9542 between 8AM and 11:45PM Pacific Time.
Well, here's an e-mail.
Mike
--
p="p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
Oppose globalization and One World Governments like the UN.
This message made from 100% recycled bits.
You have found the bank of Larn.
I can explain it for you, but I can't understand it for you.
I speak only for myself, and I am unanimous in that!
_______________________________________________
Prime mailing list
[email protected]
http://hogranch.com/mailman/listinfo/prime
