Commits

dafis committed 8515893

Note for choice of BPSW bound

  • Participants
  • Parent commits 1d5a270

Comments (0)

Files changed (1)

Math/NumberTheory/Primes/Testing/Certified.hs

 isCertifiedPrime n
     | n < 0     = isCertifiedPrime (-n)
     | otherwise = isPrime n && ((n < 10^17) || checkPrimalityProof (certifyBPSW n))
+-- Although it is known that there are no Baillie PSW pseudoprimes below 2^64,
+-- use the verified bound 10^17, I don't know whether Gilchrist's result has been
+-- verified yet.