# The Prime Sierpinski Problem

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 reflects on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s): E-mail address: g284, g341, g346, p132, L101, L188, g403, g414, L1460, L4676 (e-mail address unpublished) http://www.mersenneforum.org/showthread.php?t=2665 PrimeSierpinski (entry created on 11/19/2003 04:07:59 UTC) 564 (entry last modified on 9/26/2017 10:09:54 UTC) Active primes: on current list: 4, rank by number 15 number ever on any list: 19 for current list 51 (normalized: 817), total 51.4797, rank by score 7 168451 · 219375200 + 1 ‏(‎5832522 digits) via code L4676 on 9/26/2017 10:11:28 UTC 168451 · 219375200 + 1 ‏(‎5832522 digits) via code L4676 on 9/26/2017 10:11:28 UTC mean 14.50 (minimum 12, maximum 23)

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.

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