powered by
Test the number given for primality.
isPrime(n)
n
boolean TRUE if n is prime, FALSE if not
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.
FALSE
Other algebra: bilinear, cubicspline, division, fibonacci, horner, linterp, nthroot, polyinterp, pwiselinterp, quadratic
bilinear
cubicspline
division
fibonacci
horner
linterp
nthroot
polyinterp
pwiselinterp
quadratic
# NOT RUN { isPrime(37) isPrime(89) isPrime(100) # }
Run the code above in your browser using DataLab