U(201107)

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly.  This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.

This prime's information:

Description:U(201107)
Verification status (*):PRP
Official Comment (*):Fibonacci number, ECPP
Proof-code(s): (*):E11 : Karpovich, CM
Decimal Digits:42029   (log10 is 42028.52788275)
Rank (*):63560 (digit rank is 1)
Entrance Rank (*):62024
Currently on list? (*):short
Submitted:9/15/2023 16:35:10 UTC
Last modified:9/15/2023 21:24:56 UTC
Database id:136445
Status Flags:Verify
Score (*):36.881 (normalized score 0.0003)

Archival tags:

There are certain forms classed as archivable: these prime may (at times) remain on this list even if they do not make the Top 5000 proper.  Such primes are tracked with archival tags.
Elliptic Curve Primality Proof (archivable *)
Prime on list: yes, rank 10
Subcategory: "ECPP"
(archival tag id 228817, tag last modified 2023-11-09 22:37:15)
Fibonacci Number (archivable *)
Prime on list: yes, rank 1
Subcategory: "Fibonacci Number"
(archival tag id 228818, tag last modified 2023-09-15 17:37:10)

Verification data:

The Top 5000 Primes is a list for proven primes only. In order to maintain the integrity of this list, we seek to verify the primality of all submissions.  We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial divide and PRP check every entry before it is included in the list.
fieldvalue
prime_id136445
person_id9
machineUsing: Digital Ocean Droplet
whatprp
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -tc -q"U(201107)" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing U(201107) [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial


Running N-1 test using base 3
Generic modular reduction using generic reduction AVX-512 FFT length 16K on A 139616-bit number
Running N+1 test using discriminant 11, base 1+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 16K on A 139616-bit number
Calling N+1 BLS with factored part 0.07% and helper 0.05% (0.26% proof)


U(201107) is Fermat and Lucas PRP! (105.1135s+0.0101s)
[Elapsed time: 1.83 minutes]
modified2023-09-15 16:37:51
created2023-09-15 16:36:01
id182277

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.