isPrime: Test for Primality
In cmna: Computational Methods for Numerical Analysis
Description
Usage
Arguments
Details
Value
See Also
Examples
Description
Test the number given for primality.
Usage
1
isPrime(n)
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
cmna documentation built on July 14, 2021, 5:11 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value See Also Examples
Description
Test the number given for primality.
Usage
1 | isPrime(n)
|
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 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.