|
Bill Allombert on Sat, 13 Jan 2024 12:07:30 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Re: Implementation of forprime() and unextprime()
|
- To: pari-dev@pari.math.u-bordeaux.fr
- Subject: Re: Implementation of forprime() and unextprime()
- From: Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>
- Date: Sat, 13 Jan 2024 12:07:02 +0100
- Arc-authentication-results: i=1; smail; arc=none
- Arc-message-signature: i=1; a=rsa-sha256; d=math.u-bordeaux.fr; s=openarc; t=1705144023; c=relaxed/relaxed; bh=pz4tE7lsMoN+wMypel0bZWdyF8aq3ifah47N5H8aZhE=; h=DKIM-Signature:Date:From:To:Subject:Message-ID:Mail-Followup-To: References:MIME-Version:Content-Type:Content-Disposition: Content-Transfer-Encoding:In-Reply-To; b=tLkNlfHYr1ni3/F5J+OvziEe7rZvIG9ztL42/woykTf9WoUvEtXr+kg9l32ecgoyYlSmomBtfR/3E2hc1xoenlMAlcrREHVWIoqgHAt0bI9X2PnNQezl/8E0fig1jBLZg7CueXbq6KrRti3U/kakdhAeCQHrq/xJb1LckDyLnLR224gocPoolhuG8pjOsSIMcyFNn+/tYaJsa6pJV7Ux4OtgIdgF4dshhL3TNdRalpwLmgraFIC9UT7dv//cOp8JXWUViUEX9ppHri/TCv3MYXCnWPPgknlVa5gWjVezmSRa1EygTiITNQI5SEPAEnjyUh+LmzYyJvsNVXcMIxhqyRv2hO6a3w6SaTw1Yv66MOnQkNvICM0mp+HnIebXUm4VsJUU6VZhrRH6M14ikslGDShyBYjGZTC+mw4Saax9bZZ59OzqTFNjHmwevmXCKrutYbY+AN7qfqh4ihi+6DohmCq8Oy1aE1P7+peSF7oFIiLbB7Rk+tPLwv0lmV8tgXeuEquaJvUf3mFKnW3gpXbEc/5PH+4lZUfmmtgvwHVAizoLWoBSX4cv3D2HcQPNZJalXYYP+mUlsbCqUKU+AOVL86mah2bVZwdk5nYPisO+HjkDX6k0aOeYyzyrSiWgG+XYroScR0k72yDP9eMyBgFQvYCIZNjZgzKnVsXFWQkpNUE=
- Arc-seal: i=1; a=rsa-sha256; d=math.u-bordeaux.fr; s=openarc; t=1705144023; cv=none; b=iNzw4JGOWZKVal7FU0STA9eALAMyTUJTss6kRk/6WmvrlKmSAZiqrFRua1eE6DsrVxUpL1SCKrSOddp6d6naJx5UG5UiuhyXXLgw9dCj0a3a9Pb6woQVwEXqSsp2vbuR+k60wJToTjM6Tt7kZMDMInmJKI2hXWUioRtC1lUijHYdnpMKrNrqNO08P6No6CnQUckt59i5935lUe1NeKMGPCZHr38VNMBaN5z1P6DNn2jXykRJ+wbEgjikzU/59Fwi+JnvyTUsrxtizkJvD4padIDeI1cgwburraV5blTeX37fXMfEi3l3bwVo+thQY/r0rA2ud3xUmSYM8Db314MYo3bUQFsQVHPMfvtUd8N6Wk3XzlRJBbaXjSs3ima0IjrF8VymTZ4W65xlSOvZLl3h6EzVWoOX9cm5hxrUWV7gHLbtotszIJxX0WOes17x6/0saSDY6rcav/7UKiOa8g8nb8uMYJdbTGbl7geXB32wnApjCsGvjIK5Us/aupuAn1ZFXrKIKkUs7kzUG9iHqMkbiEh0XFp4L3uHKo+e/ZiI7q0tFLselmhf95SlwgzHWiH3OmMZKwATB/Th8mUdq6aOffUdx0TKvXw1WAxEu7nXgQvJYwqiaeiRAIvDvvRKy5CVH8qg7/1zoV/qJfAsWvh6Su42j4RzyOP2x3zPnBPH4Fk=
- Authentication-results: smail; arc=none
- Delivery-date: Sat, 13 Jan 2024 12:07:30 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=math.u-bordeaux.fr; s=2022; t=1705144023; bh=pz4tE7lsMoN+wMypel0bZWdyF8aq3ifah47N5H8aZhE=; h=Date:From:To:Subject:References:In-Reply-To:From; b=A0PY+wZytMNBKLD+NUhsv6u3QhkOJt/8XWED+nUFpgH+6bYUToSq57l65er4MWVxf BU5RYR6odevCezIcp+6vXJXywEnSfntO4lUN9EogvieqOpjAylT9zUg+Qdh5jieW9R 2HAYDBNSFMFmfRM9BMWoa2usyRsTHmYdVSvGk5UumpU8c0KPo39l+2J/oIh6wXhjsj Qu2IqXOPGuV3HpxDEipgxlCH1jmTCLk64OPq9XxpgBv/AVkUqt2qindmcZcvP2yvYK ItKiRw417e7Pl+DbCP7uP/XTAsdB005YvJBiKiHowaSz4QnXA7eixaw3okx6inNMml XGvvMwZRZoOx33EGxoI1rVBylhMzZrqLhv7voAgvS6CaVc5ImZV52oW5LqL1Yc5RoX BpQ8Oq1CZhCQiHmW79sO97A2jeIenhAiIRqp4xesPCsQxfdxJDxmST0CCR9Ekke7RO 4iFzLu9MKqQsMaWrezrLmtLHRFLquuAGR8EWKyO+kfwAmUSw6RWWiyDw0Q2aPzsJuO Q3+ycg/wGj5F2YKjCAL9uEX12Nsk1hrE7TyQ8cmgDQS5Hk7MPpGQpKPkSnJjcPTiMR u/59JIEJy4/wHnVciJ5xnn1ZRW6k1e0yktKIG5AUoSHu09GSSyF+H4JtSR1FsBd+HT 1gxgWqqkXigP9LoJRgJMvkEs=
- In-reply-to: <ZaJbx6DfYdzAFYCh@login.math.berkeley.edu>
- Mail-followup-to: pari-dev@pari.math.u-bordeaux.fr
- References: <ZaCtf8u8D+gSGbj+@login.math.berkeley.edu> <ZaHE4FFwcLv58W+8@seventeen> <ZaJbx6DfYdzAFYCh@login.math.berkeley.edu>
On Sat, Jan 13, 2024 at 01:45:43AM -0800, Ilya Zakharevich wrote:
> On Sat, Jan 13, 2024 at 12:01:52AM +0100, Bill Allombert wrote:
> > If you like to look at the code, make sure to look at the git master branch,
> > otherwise this is a bit pointless.
>
> This remark is also a tiny bit pointless without giving the HTTP url
> to browse… ⅞ ;―]
I was quite sure you could find it yourself.
See README-git in the pari distribution.
> > In particular, we have changed primelimit to 2^20 in PARI 2.16.1.
>
> Any reason why this particular value?
Yes, we store the product of all primes < 2^i for all i less than 20,
which we can then use for sieving (for factor(,0))
? for(i=1,1000,factor(random(2^1000),2^18))
With 2.15.4
*** last result computed in 1,865 ms.
With 2.16.1
*** last result computed in 124 ms.
Cheers,
Bill