Test the number given for primality.

1 | ```
isPrime(n)
``` |

`n` |
n |

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.

boolean TRUE if `n`

is prime, FALSE if not

Other algebra: `bilinear`

,
`cubicspline`

, `division`

,
`fibonacci`

, `horner`

,
`linterp`

, `nthroot`

,
`polyinterp`

, `pwiselinterp`

,
`quadratic`

1 2 3 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.