| Karim Belabas on Sat, 12 Oct 2024 17:46:59 +0200 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: computing all square root modulo a composite |
* Max Alekseyev [2024-10-12 16:58]:
> PS. I forgot to mention that I do have
> default(factor_add_primes,1);
> and so it's not repetitive factoring that slows things down.
Using this default is easy but usually not best. Either use the
[N,factor(N)] format for the functions that support it, i.e., most arithmetic
functions. Or use addprimes(factor(N)[,1]).
Cheers,
K.B.
--
Pr. Karim Belabas, U. Bordeaux, Vice-président en charge du Numérique
Institut de Mathématiques de Bordeaux UMR 5251 - (+33) 05 40 00 29 77
http://www.math.u-bordeaux.fr/~kbelabas/