On 6/5/07, Mike McCarty <[EMAIL PROTECTED]> wrote: > > Jon Strayer wrote: > > On 6/4/07, Jim Howell <[EMAIL PROTECTED]> wrote: > > > >>So, are you saying that your program finds all primes below 100? That > >>doesn't sound very useful, since those primes are very well-known > already. > >>--Jim > > > > > > > > The 100 is a variable. > > I guess I'm missing something. Your program missed some primes > not much larger than 100. Are you claiming that your program > would not have missed these primes if you increased that > variable?
"He", not me. He is claiming that his program will find all primes less than X (for any value X) and some primes larger than X. The problem I'm having is that I don't know either Mu Pad or German. The combination is making it hard for me to understand the code. But from what I'm seeing his algorithm doesn't require starting at 1. This makes me suspect it's not going to find all primes. Can anyone comment on these equations? 2x^2 + 1 p = 1,3 mod 8, 4x^2 + 1 p = 1 mod 4 and 2x^2 - 1 p = 1,7 mod 8. -- Esse Quam Videre To Be, rather than to Seem _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
