On 6/7/07, Michel <[EMAIL PROTECTED]> wrote: > > Whoops, > > I just looked at the code again. Wouldn't it be much better > to call pari's "next_prime" function. Test for primeness, if true, > return, > if false, call next_prime again etc...? > > That should be ***much*** faster than the current method.
This would work so long as pari's next_prime function *never* declares any composite number to be prime, i.e., is it true that Pari's nextprime(n) returns a number m >= n such that there are provably no primes between n+1 and m-1? Could somebody check the source/docs to see if this is the case? If so, send me a patch. William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
