News for hackers. Stuff that matters.

A comment on R49081 Is Prime. Parent comment

Re:R49081 Is Prime by squeaky-clean on Monday November 21, 2022 @12:50AM (#33689291)
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.

[ Parent | on HN ]
Re:R49081 Is Prime by noduerme on Monday November 21, 2022 @05:12AM (#33690881)
over a few million digits if you were trying for the Guinness book, wouldn't it be handy to have something that narrowed it down?
[ Parent | on HN ]
Re:R49081 Is Prime by tiagod on Monday November 21, 2022 @09:14AM (#33692662)
The 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...
[ Parent | on HN ]