Top person sorted by score

At this site we keep several lists of primes, most notably the list of the 5,000 largest known primes. Who found the most of these record primes? We keep separate counts for persons, projects and programs. To see these lists click on 'number' to the right.

Clearly one 100,000,000 digit prime is much harder to discover than quite a few 100,000 digit primes. Based on the usual estimates we score the top persons, provers and projects by adding ‎(log n)³ log log n‎ for each of their primes n. Click on 'score' to see these lists.

Finally, to make sense of the score values, we normalize them by dividing by the current score of the 5000th prime. See these by clicking on 'normalized score' in the table on the right.

rank person primes score 441 Erwin Doescher 4 47.6520 442 Ondrej Pastierik 2 47.6514 443 Roger Allen 2 47.6494 444 Mark Jones 3 47.6493 445 Charlie McDonald 2 47.6491 446 Martin Garnier 1 47.6485 447 Mincong Liang 2 47.6432 448 Alan StPierre 2 47.6338 449 Nicholas Yakubchak 2 47.6334 450 Stuart Mullage 4 47.6247 451 Jean Sébastien Delisle 2 47.6155 452 Allan St. George 2 47.6141 453 Viktor Svantner 3 47.6078 454 Alexey Simbarsky 6 47.6077 455 Falk Mehner 2 47.6049 456 Manuel Stenschke 2 47.6031 457 Lee Blyth 3 47.5983 458 Nicholas Liu 2 47.5941 459 Mike Parker 2 47.5917 460 Zhuowen Zhang 2 47.5915

move up list ↑

move down list ↓

Notes:

Score for Primes

To find the score for a person, program or project's primes, we give each prime n the score (log n)³ log log n; and then find the sum of the scores of their primes. For persons (and for projects), if three go together to find the prime, each gets one-third of the score. Finally we take the log of the resulting sum to narrow the range of the resulting scores. (Throughout this page log is the natural logarithm.)

How did we settle on (log n)³ log log n? For most of the primes on the list the primality testing algorithms take roughly O(log(n)) steps where the steps each take a set number of multiplications. FFT multiplications take about

O( log n ^. log log n ^. log log log n )

operations. However, for practical purposes the O(log log log n) is a constant for this range number (it is the precision of numbers used during the FFT, 64 bits suffices for numbers under about 2,000,000 digits).

Next, by the prime number theorem, the number of integers we must test before finding a prime the size of n is O(log n) (only the constant is effected by prescreening using trial division).  So to get a rough estimate of the amount of time to find a prime the size of n, we just multiply these together and we get

O( (log n)³ log log n ).

Finally, for convenience when we add these scores, we take the log of the result.  This is because log n is roughly 2.3 times the number of digits in the prime n, so (log n)³ is quite large for many of the primes on the list. (The number of decimal digits in n is floor((log n)/(log 10)+1)).