The Prime Sierpinski Problem
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 
project A titan, as defined by Samuel Yates, is anyone who has found a titanic prime. This page provides data on those that have found these primes. The data below only reflect on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s): g284, g341, g346, p132, L101, L188, g403, g414, L1460, L4676
E-mail address: (e-mail address unpublished)
Web page:http://www.mersenneforum.org/showthread.php?t=2665
Username: PrimeSierpinski (entry created on 11/18/2003)
Database id:564 (entry last modified on 09/26/2017)
Active primes:on current list: 6, rank by number 16
Total primes: number ever on any list: 19
Production score: for current list 51 (normalized: 2258), total 51.4797, rank by score 6
Largest prime: 168451 · 219375200 + 1 ‏(‎5832522 digits) via code L4676 on 09/26/2017
Most recent: 168451 · 219375200 + 1 ‏(‎5832522 digits) via code L4676 on 09/26/2017
Entrance Rank: mean 16.75 (minimum 12, maximum 24)

Descriptive Data: (report abuse)
A Sierpinski number is an odd number k such that k.2^n +1 is not prime for any n > 0. A prime Sierpinski number is a prime number k such that k.2^n +1 is not prime for any n > 0. The smallest known prime Sierpinski number is k=271129. Finding a prime of type k.2^n+1 for all primes k less than 271129 will be sufficient to prove that 271129 is the smallest prime Sierpinski number. The prime Sierpinski problem consists of finding these primes.

I administer The Prime Sierpinski Problem and I would like to
Edit this page
Surname: PrimeSierpinski (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.