Top persons sorted by score (Another of the Prime Pages' resources)

The Prover-Account Top 20
Persons by: number score normalized score
Programs by: number score normalized score
Projects by: number score normalized 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)3 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 375 Jerzy Gieorgijewski 1 44.8102 376 Gus Obermeyer 2 44.8075 377 Tomasz R. Gwiazda 4 44.8070 378 Greg Adams 1 44.8069 379 Marc Koschewski 2 44.8029 380 Allen Evans 1 44.7952 381 Sander Kõluvere 1 44.7942 382 Roman Krompolc 1 44.7934 383 Jeff Webster 3 44.7846 384 Jerome Brebois 1 44.7840 385 John ODonnell 2 44.7837 386 Matthew Bouch 1 44.7837 387 Oki Murai 1 44.7827 388 Tim Rickard 3 44.7824 389 Masumi Hamada 2 44.7803 390 Mark Williams 1 44.7774 391 Martyn Bamber 2 44.7673 392 Kenta Miyakoshi 3 44.7667 393 Lars Wallin 2 44.7660 394 James Winskill 2 44.7649

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