3 ms·
How do you prove that you verified that a number is a prime? If you want to prove that a number is not a prime you can show the factorization or that it breack
by gus_massa 2y ago
How do you prove that you verified that a number is a prime?
If you want to prove that a number is not a prime you can show the factorization or that it breack the little theorem of Fermat with 367984321568, and everyone can check the refutation inmediately.
I don't know a similar method to show that you actualy verified the number is a prime.
- ColinWright 2y agoThere are primality proving certificates. https://en.wikipedia.org/wiki/Primality_certificate https://en.wikipedia.org/wiki/Primality_certificate These are sometimes infeasible for stupidly big numbers, but the Mersenne Primes have a specific structure that allows for simplification of the process.