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.)

User supplied image--mail editor to report abuse.
Proof-code(s): L3839, p294, L4026, p379, L4142, L4506, L4561, L5123, CH13, p423, c98, p437
E-mail address: (e-mail address unpublished)
Web page:http://sourceforge.net/projects/emsieve/
Username EMsieve (entry created on 3/29/2014 09:30:08 UTC)
Database id:4141 (entry last modified on 11/17/2023 21:08:43 UTC)
Program Does *: sieve
Active primes:on current list: 88, rank by number 11
Total primes: number ever on any list: 206
Production score: for current list 54 (normalized: 15431), total 54.4665, rank by score 8
Largest prime: Phi(3, - 4658591048576) ‏(‎11887192 digits) via code L4561 on 5/31/2023 19:32:31 UTC
Most recent: Phi(3, 93606177147) ‏(‎1761304 digits) via code p437 on 11/29/2023 17:11:02 UTC
Entrance Rank: mean 7476.50 (minimum 7, maximum 125249)
Unprocessed: prime submissions still untested or inprocess: 1.

Descriptive Data: (report abuse)

This code corresponds to both a simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1, and a special modified variant of LLR (with due credit for the original framework code to Jean Penne, and to George Woltman for GWNUM).

See http://oeis.org/A066408, A125739, and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k).

After sieving, the Berrizbeitia-Iskra or the Proth test can be run; this is best implemented with FFT mod (33p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov.

Also, this code is extended to an accessory GPU-assisted sieve for pre-factoring both Eisenstein-Mersenne and Gaussian-Mersenne candidates. This CUDA program is adapted from well-known mfaktc [2].

  1. P.Berrizbeitia, B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=
  2. OEIS: http://oeis.org/
  3. http://www.mersennewiki.org/index.php/Mfaktc

Surname: EMsieve (used for alphabetizing and in codes).
Unverified primes are omitted from counts and lists until verification completed.
I administer EMsieve and I would like to
Edit this page
Printed from the PrimePages <t5k.org> © Reginald McLean.