Re: bug in isprime()

[Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>]

* John Cremona [2007-09-07 23:30]:
> One such place is in class number computations (which Bill has been
> looking into in detail), the other is in prime factorizations.

Any problem with bnfcertify ?  Besides the facts that 

1) if the input bnf is actually invalid, it may enter an infinite loop

2) it uses bounds which in most cases could be made much sharper.

> While I am here, can you tell me whether or not factor(n) and
> factorint(n) are the same for integers n?

They are.

Cheers,

    K.B.
--
Karim Belabas                  Tel: (+33) (0)5 40 00 26 17
Universite Bordeaux 1          Fax: (+33) (0)5 40 00 69 50
351, cours de la Liberation    http://www.math.u-bordeaux.fr/~belabas/
F-33405 Talence (France)       http://pari.math.u-bordeaux.fr/  [PARI/GP]
`