17443#/2 - 217443

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:17443#/2 - 217443
Verification status (*):PRP
Official Comment (*):ECPP
Proof-code(s): (*):c43 : Hiltbrunner, Primo
Decimal Digits:7508   (log10 is 7507.4216900821)
Rank (*):85769 (digit rank is 1)
Entrance Rank (*):38128
Currently on list? (*):no
Submitted:7/12/2007 14:05:29 UTC
Last modified:3/11/2023 15:54:10 UTC
Database id:81647
Status Flags:Verify
Score (*):31.551 (normalized score 0)

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: no, rank 425
Subcategory: "ECPP"
(archival tag id 194583, tag last modified 2024-04-24 05:37:25)

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_id81647
person_id9
machineRedHat P4 P4
whatprp
notesCommand: /home/caldwell/client/pfgw -tc -q"17443#/2-2^17443" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 17443#/2-2^17443 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) Reduced from FFT(3072,18) to FFT(3072,17) 49888 bit request FFT size=(3072,17) Running N-1 test using base 5 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) Reduced from FFT(3072,18) to FFT(3072,17) 49888 bit request FFT size=(3072,17) Running N+1 test using discriminant 13, base 6+sqrt(13) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) Reduced from FFT(3072,18) to FFT(3072,17) 49896 bit request FFT size=(3072,17) Calling N-1 BLS with factored part 0.09% and helper 0.06% (0.33% proof) 17443#/2-2^17443 is Fermat and Lucas PRP! (31.4800s+0.0000s) [Elapsed time: 32 seconds]
modified2020-07-07 22:30:41
created2007-07-12 14:10:01
id92404

fieldvalue
prime_id81647
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/pfgw -o -f -q"17443#/2-2^17443" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] trial factoring to 2107126 17443#/2-2^17443 has no small factor. [Elapsed time: 1.496 seconds]
modified2020-07-07 22:30:41
created2007-07-12 14:22:01
id92405

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