Don't know how I missed this, but a polynomial-time algorithm for determining primality was recently discovered. This throws a wrench into my plans to sell at a ludicrous markup the Richardson Constant-Time Probabilistic Primality Test (motto: "Correctly indicates primality infinitely often!"), so I'll release it here into the public domain:
def probablyPrime(n):
if n > 1 and n <= 7:
return 1
else:
return 0

![No comments [No comments]](/nb/assets/no-comments.png)
No comments yet.