I *think* this one will be OK. The call to the factoring algorithm is probably just to look for small factors and for perfect powers. It's mainly done for efficiency reasons I think.
I noticed this too, but decided it was probably OK (pun intended). Bill. On 7 Sep, 20:51, "John Cremona" <[EMAIL PROTECTED]> wrote: > It gets worse: (with GP/PARI 2.4.2): > > ? default(debug,2) > %5 = 2 > ? p=nextprime(10^20) > %6 = 100000000000000000039 > ? isprime(p) > *** isprime: Warning: IFAC: untested integer declared prime. > 507526619771207 > %7 = 1 > > -- so one call to isprime(), which supposedly proves a proof, involves > further calls (presumably) to fact() whose reults are not proved. > > Another email to pari-dev is in order... > > John > > On 9/7/07, Bill Hart <[EMAIL PROTECTED]> wrote: > > > > > > > The number field code in Pari relies on factoring the discriminant > > often using MPQS. In particular if you turn debugging mode on, you get > > warnings like this: > > > *** bnfclassunit: Warning: IFAC: untested integer declared prime. > > 10762727634633706239259776012492757340083 > > > So basically the number field code is no more reliable than a probable > > prime test. > > > This is bad news if you only want unconditional results from Pari. It > > may not be trivial to get unconditional results from all Pari > > functions. > > > Bill. > > -- > John Cremona --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
