Georgi Guninski on Tue, 23 May 2023 17:31:39 +0200


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: factor and factorint performances 

On Tue, May 23, 2023 at 1:40 PM Jean-Luc ARNAUD <jl.arnaud@free.fr> wrote:
>

> Playing with factor and factorint functions, I was amazed at their performances (compared to other Math libraries), until I tried to factorize 2^1003-1.

Observe that 1003 is composite so x^1003-1 factors over the integers,
which gives Aurifeaulian factorization.

Another resource is factordb.com:

http://www.factordb.com/index.php?query=2%5E1003-1