Kurt Foster on Sun, 17 Nov 2024 03:08:44 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: PARI/GP timings for operations on biggest known 41,024,320 decimal digit prime
|
- To: Pari Users <pari-users@pari.math.u-bordeaux.fr>
- Subject: Re: PARI/GP timings for operations on biggest known 41,024,320 decimal digit prime
- From: Kurt Foster <drsardonicus@earthlink.net>
- Date: Sat, 16 Nov 2024 20:08:39 -0600
- Authentication-results: earthlink-vadesecure.net; auth=pass smtp.auth=drsardonicus@earthlink.net smtp.mailfrom=drsardonicus@earthlink.net;
- Delivery-date: Sun, 17 Nov 2024 03:08:44 +0100
- Dkim-signature: v=1; a=rsa-sha256; bh=TmdDoPNgAbRQuEtSe3MISvi+8FsdDVNN298Aqr y+zpE=; c=relaxed/relaxed; d=earthlink.net; h=from:reply-to:subject: date:to:cc:resent-date:resent-from:resent-to:resent-cc:in-reply-to: references:list-id:list-help:list-unsubscribe:list-unsubscribe-post: list-subscribe:list-post:list-owner:list-archive; q=dns/txt; s=dk12062016; t=1731809320; x=1732414120; b=m71m7Dcs0W/SHZ9hM/JtNfae9zM q/iu0WXQto11QA8MQtCz1ixlbK3vTpc8qbII1yfFlXPzbTgtJiHEYQLzXRTUGuPsUFS6I9l nP0xnfs4UA3JzmzlBbRRrfEjBjb4hUwqzcaa9Cx+RQbnuP/tzyQizpYDOCzr1V3pAm4a4pZ si3djP0HsF6rPJNUat58AWgfz9puyExz2L8NRrucklRCcGbmaMZoypbSRMpeayROwEJOP7n XEx9/8s0WnINSz5qiaZ3f4U5IvrTOaHskmrOoLJJ3xrtA0gEYf835ouq7DpuMO3rBAdqPVN C3CFk4wPGmskj9DPHGfuqwzO/gj58MA==
- In-reply-to: <2a30482241c6ff4e99a8f26ebfc0d3fb@stamm-wilbrandt.de>
- References: <2a30482241c6ff4e99a8f26ebfc0d3fb@stamm-wilbrandt.de>
On Nov 15, 2024, at 2:28 PM, hermann@stamm-wilbrandt.de wrote:
Recently new biggest known prime (41,024,320 decimal digits) M_52
was found.
It turned out that for all Mersenne primes but M_1, -3 is a
quadratic residue.
Therefore there are integers x,y with M_52=x^2+3*y^2.
OK, here we go!
We have p = 136279841 == 5 (mod 22), so 2^p - 1 = M == 2^5 - 1 == 8
(mod 23). Now (8/23) = (2/23) = +1, and M == 3 (mod 4) so by
quadratic reciprocity
(-23/M) = (M/23) = +1. That is, -23 is a quadratic residue (mod M).
Using the usual formula, we have that
(-23)^((M+1)/4) is a square root of -23 (mod M). [Since (M+1)/4 is
even (in fact, a power of 2), we can take 23^((M+1)/4) instead.]
However, this does NOT insure that M = x^2 + 23*y^2. One possible way
to test the question is to compute a square root of -23 (mod M) and
use halfgcd (Cornacchia algorithm) and see whether it produces a
solution.
In any case, the prime M splits into two prime ideals in
Q(sqrt(-23)). If M = x^2 + 23*y^2 the ideals are principal; otherwise
not.