| Bill Allombert on Mon, 6 Jan 2003 14:31:10 +0100 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: isprime(,2) |
On Wed, Dec 25, 2002 at 10:02:47PM -0500, Igor Schein wrote:
> Hi,
>
> When I tried isprime(P3460,2), I got
> *** object too big, length can't fit in a codeword
>
> 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.
Cheers,
Bill.