Dodatkowe przykłady dopasowywane są do haseł w zautomatyzowany sposób - nie gwarantujemy ich poprawności.
The official proof of a prime is through its primality certificate.
Unlike the other probabilistic tests, this algorithm produces a primality certificate, and thus can be used to prove that a number is prime.
See primality certificate for details.
Primality certificates allow the primality of a number to be rapidly checked without having to run an expensive or unreliable primality test.
In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime.
Primality certificates lead directly to proofs that problems such as primality testing and the complement of integer factorization lie in NP, the class of problems verifiable in polynomial time given a solution.
The concept of primality certificates was historically introduced by the Pratt certificate, conceived in 1975 by Vaughan Pratt, who described its structure and proved it to have polynomial size and to be verifiable in polynomial time.
We don't want to just force the verifier to factor the number so a better way to avoid this issue is to give primality certificates for each of the prime factors of n 1 as well, which are just smaller instances of the original problem.
Słownik matematyczny