|
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
|
- To: jl.arnaud@free.fr
- Subject: Re: factor and factorint performances
- From: Georgi Guninski <gguninski@gmail.com>
- Date: Tue, 23 May 2023 18:25:29 +0300
- Cc: pari-dev@pari.math.u-bordeaux.fr
- Delivery-date: Tue, 23 May 2023 17:31:39 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20221208; t=1684855620; x=1687447620; h=content-transfer-encoding:cc:to:subject:message-id:date:from :in-reply-to:references:mime-version:from:to:cc:subject:date :message-id:reply-to; bh=XZKJ0mwCdDBLA0+3TzMYWY5jYcFkzOJZ0cDF/HZoZIc=; b=MjKasP8ISwh2cz6vYmZh9trYkHz3SfuAGc1zoTGJkOPzTb6RMoIcJ1IK2exFMk9FUm rvgqlOiXn6fYfJPsrOT28Tv1RwtKYFGj3fSPIdt6y7xKSLCZ4cOV6yvrzbDLeSsJj34N kOdGnm1FrtI11SCb35lHAQOq6DfTfInEH63Z/eaFMNnmK27Up8nsfAyWN4CxkvSagsrW tO53qemSbFx7zT0YZ7KCoLPCIN4fsZVTh/NW/FMmWrK5HI8AUs2gFYiQBpBj+kClx+jo WVQX2BX7zsasPZ8fLPmV9t9RyLzgX4NUQo5r724nhlCPlEtDoaIDn6PggaKyEhGff8li y+Uw==
- In-reply-to: <1ce43d63-78db-9df0-9a1d-8b5fc747aae7@free.fr>
- References: <1ce43d63-78db-9df0-9a1d-8b5fc747aae7@free.fr>
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