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)). For numbers less than 1014, pseudo-prime and prime are equivalent.
The is_pseudoprime command is a test for a pseudo-prime.
Examples.
1 |
2 |
0 |
1 |