👩💻 Join our community of thousands of amazing developers!

In the process of creating a Pratt certificate to prove that a number n is prime, you have to find a number a that seems kinda arbitrary. As we discussed here, a number n is prime if there exists a number a such that an-1 = 1 mod n and a(n-1)/p ≠ 1 mod n […] The post Probability problem with Pratt prime proofs first appeared on John D. Cook....