Yves Gallot


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): g0, GF0, p192
E-mail address: galloty@wanadoo.fr
Web page:http://perso.wanadoo.fr/yves.gallot/
Username Gallot (entry created on 1/18/2000 12:50:53 CDT)
Database id:8 (entry last modified on 5/14/2008 09:45:11 CDT)
Active primes:on current list: 1 (unweighted total: 1), rank by number 541
Total primes: number ever on any list: 567 (unweighted total: 568)
Production score: for current list 45 (normalized: 3), total 46.0420, rank by score 724
Largest prime: 572186131072 + 1 ‏(‎754652 digits) via code g0 on 1/8/2004 13:14:59 CDT
Most recent: (3040612288 + 698989 · (304068192 + 1))2 + 2 ‏(‎110174 digits) via code p192 on 4/17/2006 04:16:09 CDT
Entrance Rank: mean 9.00 (minimum 9, maximum 9)

Descriptive Data: (report abuse)

Yves writes:

I was born in 1966, married and living in Toulouse, France. I am "Ingénieur de l'Ecole Supérieure d'Electricité" specialized in Signal Processing Theory. I am working in a small company on different projects about simulators. My main hobby is computational number theory.
Yves Gallot is also the author of a popular program for applying Proth's theorem to primality proving.
Error in data above: HTML_Tidy reports: line 11 column 63 - Warning: inserting implicit <p> line 11 column 63 - Warning: trimming empty <p>

Surname: Gallot (used for alphabetizing and in codes).
Unverified primes are omitted from counts and lists until verification completed.
I am Yves Gallot and I would like to
Edit this page

Submit primes using the proof-code: (a password will be required)

(Reuse an old code if your are using the same programs, projects... Only create a new code if you are doing something differently than in the past. Duplicate codes will be merged.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.