3 ms·
If we consider prime numbers above 1000 digits def is prime(n): return False Would be 99.99% accurate. The issue is without 100% certainty, there's n
by squeaky-clean 4y ago
If we consider prime numbers above 1000 digits
def is prime(n):
return False
Would be 99.99% accurate.
The issue is without 100% certainty, there's not really any use for a "this is very likely probably prime" checker.
- noduerme 4y agoover a few million digits if you were trying for the Guinness book, wouldn't it be handy to have something that narrowed it down?
- tiagod 4y agoThe time you spent writing this you could've googled mersenne primes and how candidates are selected. You would've found out there are loads of techniques to narrow them down, and that we're looking for specific types of primes as the first step in this. Then you would've avoided coming off as a dunning-kruger know-it-all...