On Sun, 21 Jan 2007 23:20:03 -0800, Nick Alexander <[EMAIL PROTECTED]> wrote:
> > Can someone tell me what primality tests are available in sage? I'd > like a fast probabilistic algorithm if possible, I don't need > certificates. Maybe what is pseudo-prime testing called in pari? As far as I know PARI is the only component of SAGE that has respectable primality testing. In fact, in my experience it is *very* respectable, beating everything else I know of for general integers. Thus I refer you to the PARI documentation. Feel free to report back to this list with what you find. -- William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] 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/ -~----------~----~----~----~------~----~------~--~---
