If is_pseudoprime(n) returns 2 (true), then
n is prime.
If it returns 1, then n is pseudo-prime (most
probably prime).
If it returns 0, then n is not prime.
Definition: For numbers less than 1014, pseudo-prime and prime
are equivalent. But for numbers greater than 1014, a pseudo-prime
is a number with a large probability of being prime (cf. Rabin’s Algorithm and
Miller-Rabin’s Algorithm in the Algorithmic part (menu
Help->Manuals->Programming)).
Input :
Output :
Input :
Output :
Input :
Output :
Input :
Output :