@[email protected] to Science [email protected]English • 5 months agoAnd that is why I don't do statisticsi.imgur.comimagemessage-square23fedilinkarrow-up1490arrow-down17cross-posted to: [email protected]
arrow-up1483arrow-down1imageAnd that is why I don't do statisticsi.imgur.com@[email protected] to Science [email protected]English • 5 months agomessage-square23fedilinkcross-posted to: [email protected]
minus-squareKogasalinkEnglish14•5 months agoPer 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).
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).
So you better use 128-bit unsigned integers 😅