so I didn't know this, but got curious about how many known prime there are - I knew there were infinite primes, but thought that there would be some concrete list of all the primes that we had discovered somewhere - but apparently not https://math.stackexchange.com/questions/272791/how-many-pri... > Nobody's really keeping count. ... There are very many hundred-digit primes to find. We could cover the Earth in hardd…
The relevant thing is not that's a prime (it's pretty trivial to find one), but a Mersenne Prime
Primality testing is not trivial at those number sizes
so I didn't know this, but got curious about how many known prime there are - I knew there were infinite primes, but thought that there would be some concrete list of all the primes that we had discovered somewhere - but apparently not https://math.stackexchange.com/questions/272791/how-many-pri... > Nobody's really keeping count. ... There are very many hundred-digit primes to find. We could cover the Earth in hardd…
I also used to think that there weren't very many primes. But the prime number theorem says that the number of primes less than n is about n/log(n). The function log doesn't grow very fast, so a large proportion of numbers are prime. For example the number of primes less than 10^100 is 4*10^97.
so I didn't know this, but got curious about how many known prime there are - I knew there were infinite primes, but thought that there would be some concrete list of all the primes that we had discovered somewhere - but apparently not https://math.stackexchange.com/questions/272791/how-many-pri... > Nobody's really keeping count. ... There are very many hundred-digit primes to find. We could cover the Earth in hardd…
RSA encryption keys uses the product of two large primes, where each prime is many digits long. So many new primes are "discovered" every day.
Interestingly, those primes' primality is normally proven statistically rather than deductively. This is not really a practical issue for people using RSA, but could be a philosophical issue for someone interested in the question of how many different numbers' primality has been proven by humanity.
RSA encryption keys uses the product of two large primes, where each prime is many digits long. So many new primes are "discovered" every day.
Interestingly, those primes' primality is normally proven statistically rather than deductively. This is not really a practical issue for people using RSA, but could be a philosophical issue for someone interested in the question of how many different numbers' primality has been proven by humanity.
In fact if someone worked out how to crack RSA when it turned out that one of those numbers weren't prime then they would have invented a fast primality check. Which would be really cool in itself, and allow RSA to be fixed.
The link has another link to a page describing why this matters: http://primes.utm.edu/notes/faq/why.html
> Mersennes are beautiful and have some surprising applications. Unfortunately that page doesn’t elaborate on what these surprising applications are, which is itself surprising on a page that purports to answer “why”.
It automatically results in the discovery of a new perfect number. :-)
so I didn't know this, but got curious about how many known prime there are - I knew there were infinite primes, but thought that there would be some concrete list of all the primes that we had discovered somewhere - but apparently not https://math.stackexchange.com/questions/272791/how-many-pri... > Nobody's really keeping count. ... There are very many hundred-digit primes to find. We could cover the Earth in hardd…
The relevant thing is not that's a prime (it's pretty trivial to find one), but a Mersenne Prime Primality testing is not trivial at those number sizes
not really, it is very hard to test any very large number for primality... this project only test numbers that satisfy the Mersenne prime definition though... 9 of the 10 known largest primes are Mersenne prime numbers probably because there is more people testing these numbers.