Re: computing all square root modulo a composite

[Max Alekseyev <maxale@gmail.com>]

On Sat, Oct 12, 2024 at 11:46 AM Karim Belabas <Karim.Belabas@math.u-bordeaux.fr> wrote:

* 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]).

Karim,

Could you please elaborate on your last comment?

How explicit calling addprimes(factor(N)[,1]) is better than just having default(factor_add_primes,1) and not calling addprimes() ?

Regards,

Max