• palordrolap@fedia.io
    link
    fedilink
    arrow-up
    3
    ·
    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.