| Karim BELABAS on Mon, 6 Jan 2003 15:41:58 +0100 (MET) |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: isprime(,2) |
On Mon, 6 Jan 2003, Bill Allombert wrote:
> On Wed, Dec 25, 2002 at 10:02:47PM -0500, Igor Schein wrote:
>> Manual doesn't say anything about implementation limitations for
>> APRCL.
>
> Also the short help is not up-to-date :
>
> ? ?isprime
> isprime(x,{flag=0}): if flag is omitted or 0, true(1) if x is a strong
> pseudoprime for 10 random bases, false(0) if not. If flag is 1, the primality
> is certified by the Pocklington-Lehmer Test. If flag is 2, the primality is
> certified using the APRCL test.
short help for ispseudoprime was equally out of date.
Both fixed.
Karim.
P.S: I'm investigating the implementation limitations of APRCL...
--
Karim Belabas Tel: (+33) (0)1 69 15 57 48
Dép. de Mathématiques, Bât. 425 Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud Email: Karim.Belabas@math.u-psud.fr
F-91405 Orsay (France) http://www.math.u-psud.fr/~belabas/
--
PARI/GP Home Page: http://www.parigp-home.de/