Re: factor and factorint performances

Georgi Guninski <[email protected]>
Newsgroups gmane.comp.mathematics.pari.devel
Message-ID <CAGUWgD8CJ-Eoj9ggLZiN9z6Bdf=AwpDKkepN+9z8hiPVOB+cOg@mail.gmail.com> 
On Tue, May 23, 2023 at 1:40 PM Jean-Luc ARNAUD <[email protected]> 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
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.