Re: Cunningham primes tables
Aurel Page <[email protected]>
| Newsgroups | gmane.comp.mathematics.pari.devel |
|---|---|
| Message-ID | <[email protected]> |
Dear Jean-Luc, Every function that may need a factorisation. There are many of them, including obvious ones like eulerphi, but also for instance nfinit: nfinit(x^2 - (2^1003-1)); Cheers, Aurel On 30/05/2023 16:00, Jean-Luc ARNAUD wrote: > Hello, > > Apart from factor and factorint, what other commands take advantage of > cunningham tables? > > Thanks >