you are viewing a single comment's thread
view the rest of the comments
[–] 4 points 9 hours ago (4 children)

Does this mean I can conjure up a crazy prime number with a little algebra now?

  • source
  • hideshow 4 child comments
  • [–] 9 points 9 hours ago

    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.

  • source
  • parent
  • [–] 3 points 3 hours ago

    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.

  • source
  • parent