Michel wrote: > It has often bothered me that there is a big difference in > performance between > next_prime(...) and > (...).next_prime() > > I.e. try (...)=2^4096. > > Looking at the source code I see that the first gives (by default) a > provable > result, whereas the second gives a probabilistic result. > > I think these methods/functions should have identical behaviour. > What do other people think?
Agreed. > > Michel > > > > > --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
