No more so than you could do before - we’ve been assuming that Reimann is true since forever, a lot of modern mathematics depends on it. And we already have ways to conjure up extremely large numbers that are almost certainly prime, such as Fermat’s primality test. RSA encryption depends on us being able to do that, in fact.
Largely unrelated. Generating primes has always been relatively easy. All you need is a random number generator, a primality checker and the ability to keep adding one until the primality checker says it’s prime.
Now if you want to count the number of primes below a certain number, you’re moving closer to Riemann Hypothesis territory, but I don’t think this result will help much with that either.
Does this mean I can conjure up a crazy prime number with a little algebra now?
Riemann isn’t a prime generator, it’s a prediction of how many primes exist in any contiguous sequence of integers.
What if you binary search on that sequence? How much computation is required to predict the number of primes?
No more so than you could do before - we’ve been assuming that Reimann is true since forever, a lot of modern mathematics depends on it. And we already have ways to conjure up extremely large numbers that are almost certainly prime, such as Fermat’s primality test. RSA encryption depends on us being able to do that, in fact.
Largely unrelated. Generating primes has always been relatively easy. All you need is a random number generator, a primality checker and the ability to keep adding one until the primality checker says it’s prime.
Now if you want to count the number of primes below a certain number, you’re moving closer to Riemann Hypothesis territory, but I don’t think this result will help much with that either.