32888387 - 31444194 + 1

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:32888387 - 31444194 + 1
Verification status (*):Proven
Official Comment (*):Generalized unique
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L5123 : Propper, Batalov, EMsieve, LLR
Decimal Digits:1378111   (log10 is 1378110.829556)
Rank (*):605 (digit rank is 1)
Entrance Rank (*):439
Currently on list? (*):short
Submitted:6/19/2023 00:10:42 UTC
Last modified:3/31/2024 19:30:34 UTC
Database id:136178
Status Flags:none
Score (*):47.6168 (normalized score 13.305)

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.
Generalized Unique (archivable *)
Prime on list: yes, rank 19
Subcategory: "Generalized Unique"
(archival tag id 228644, tag last modified 2023-12-14 08:37:23)

User comments about this prime (disclaimer):

User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.

Serge Batalov writes (21 Jun 2023):  (report abuse)
Eisenstein Mersenne Norm prime #27
This prime may also be written as: 3^2888387-3^1444194+1
Also, can be written using positive integers in cyclotomic polynomial:
Phi(3, 31444194 - 2)/3 or
Phi(6, 31444194 - 1)/3

Good reference materials for Eisenstein Mersenne Norm primes are at OEIS A066408.

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_id136178
person_id9
machineUsing: Digital Ocean Droplet
whatprime
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -tc -q"Phi(3,-3^1444194+1)/3" 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing Phi(3,-3^1444194+1)/3 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial


Running N-1 test using base 2
Generic modular reduction using generic reduction FMA3 FFT length 480K, Pass1=384, Pass2=1280, clm=4 on A 4577986-bit number
Running N-1 test using base 3
Generic modular reduction using generic reduction FMA3 FFT length 480K, Pass1=384, Pass2=1280, clm=4 on A 4577986-bit number
Running N-1 test using base 29
Generic modular reduction using generic reduction FMA3 FFT length 480K, Pass1=384, Pass2=1280, clm=4 on A 4577986-bit number
Running N+1 test using discriminant 41, base 2+sqrt(41)
Generic modular reduction using generic reduction FMA3 FFT length 480K, Pass1=384, Pass2=1280, clm=4 on A 4577986-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 43/4578040 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 41, base 2+sqrt(41)
Generic modular reduction using generic reduction FMA3 FFT length 512K, Pass1=256, Pass2=2K, clm=2 on A 4577986-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 44/4578040 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a2 (or possibly -a0) switch)
Running N+1 test using discriminant 41, base 2+sqrt(41)
Generic modular reduction using generic reduction FMA3 FFT length 560K, Pass1=448, Pass2=1280, clm=4 on A 4577986-bit number
Calling N-1 BLS with factored part 50.00% and helper 0.00% (150.00% proof)


Phi(3,-3^1444194+1)/3 is prime! (426948.9510s+0.1266s)
[Elapsed time: 4.94 days]
modified2023-06-24 01:14:14
created2023-06-19 02:38:25
id182011

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