• Kogasa
    link
    fedilink
    English
    arrow-up
    14
    ·
    10 months ago

    Per the prime number theorem, for large enough N the proportion of primes less than or equal to N is approximately 1/log(N). For N = 2^(31) that’s ~0.0465. To get under 1% you’d need N ~ 2^(145).

    • lad
      link
      fedilink
      English
      arrow-up
      4
      ·
      10 months ago

      So you better use 128-bit unsigned integers 😅