isPrime -- tell whether an integer is a prime

isPrime -- tell whether an integer is a prime

isPrime x -- tests for primality

isPrime n -- returns true if the integer n is probably a prime, and false if n is not a prime.

At the moment, for numbers larger than 2^31-1 it checks for divisibility by small primes, and then applies a strong pseudoprimality test (Rabin-Miller) to the base 2.

isPrime f -- returns true if the polynomial f is irreducible, otherwise false.

Class of returned value: Boolean -- the class of Boolean valuesWays to use isPrime :

isPrime ZZ