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 961 Masumi Hamada 1 45.4570 962 Tristan Nolan 1 45.4565 963 Joachim Haberer 1 45.4562 964 Raphaël Jeudy 1 45.4561 965 Lonnie Christensen 1 45.4537 966 Fangping Wen 1 45.4526 967 John Morriss 1 45.4496 968 Robert Meckley 1 45.4491 969 Yasuhito Suzuki 1 45.4483 970 Pablo Moreno 1 45.4480 971 Michael O'Mara 1 45.4471 972 Mengru Liu 1 45.4467 973 钟业海 1 45.4465 974 Václav Vinklát 1 45.4103 975 Peter Grobstich 2 45.1964 976 Lasse Mejling Andersen 1 45.0970 977 Bart Kus 1 45.0576 978 Yuma Hayashi 1 45.0172 979 Makoto Morimoto 3 45.0070 980 Geoffrey Exoo 0.5 44.9006 980 Jeff Kinne 0.5 44.9006

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