Test for Primality

Share:

Description

Test the number given for primality.

Usage

1

Arguments

n

n

Details

This function tests n if it is prime through repeated division attempts. If a match is found, by finding a remainder of 0, FALSE is returned.

Value

boolean TRUE if n is prime, FALSE if not

See Also

Other algebra: bilinear, cubicspline, division, fibonacci, horner, linterp, nthroot, polyinterp, pwiselinterp, quadratic

Examples

1
2
3
isPrime(37)
isPrime(89)
isPrime(100)

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.