prime: Function to assess whether or not an integer is prime.
In spuRs: Functions and Datasets for "Introduction to Scientific Programming and Simulation Using R"
Description
Usage
Arguments
Details
Value
References
See Also
Examples
Description
An inefficient, brute-force algorithm to assess whether or not an integer is prime.
Usage
1
prime(n)
Arguments
n
The integer.
Details
The function assumes that n is a positive integer.
Value
The function returns a logical object that is TRUE if the integer is prime.
References
Jones, O.D., R. Maillardet, and A.P. Robinson. 2009. An Introduction
to Scientific Programming and Simulation, Using R. Chapman And Hall/CRC.
See Also
Examples
1
2
spuRs documentation built on May 2, 2019, 12:44 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 References See Also Examples
Description
An inefficient, brute-force algorithm to assess whether or not an integer is prime.
Usage
1 | prime(n)
|
Arguments
n |
The integer. |
Details
The function assumes that n is a positive integer.
Value
The function returns a logical object that is TRUE if the integer is prime.
References
Jones, O.D., R. Maillardet, and A.P. Robinson. 2009. An Introduction to Scientific Programming and Simulation, Using R. Chapman And Hall/CRC.
See Also
Examples
1 2 |
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.