Hi John, Yes, I am fully aware of what GIMPS is, and have been running primes95 for over 8 years on variuos computers. But all you're doing is finding smaller primes to use as exponents to find the Mersenne primes. If you can deterministically find P exponents faster and with certainty then you are more ahead of the game.
Also, my primality tester can be applied to the Meresenne prime candidates. You just need to implement this very siimple, and deterministic, method to deal with the size of numbers you are dealing with, like you are trying to do with primes95. After all, modulo n operations are just successive subtractions of n from the number until it is <= n. That's a whole lot easier than what primes95 is trying to do. Hotep (Peace) Jabari ----- Original Message ----- From: "John R Pierce" To: "The Great Internet Mersenne Prime Search list" Subject: Re: [Prime] Ultimate Prime Sieve - Sieve of Zakiya (SoZ) Date: Sat, 07 Jun 2008 22:29:02 -0700 Jabari Zakiya wrote: > This is to announce the release of my paper "Ultimate Prime Sieve -- > Sieve of Zakiiya (SoZ)" in which I show and explain the development of > a class of Number Theory Sieves to generate prime numbers. do you understand that the GIMPS project is working with prime numbers that have a million digits (2^3,000,000 or more)? the amount of storage, and computational time for /any/ sort of sieve algorithm would be astronomical _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime -- See Exclusive Videos: 10th Annual Young Hollywood Awards http://www.hollywoodlife.net/younghollywoodawards2008/ _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
