Functions to test whether a number is prime and generate the prime numbers within a specified range. Based around an implementation of Wilson's theorem for testing for an integer's primality.
| Version: | 0.1.0 |
| Imports: | Rcpp |
| LinkingTo: | Rcpp |
| Suggests: | testthat |
| Published: | 2015-06-22 |
| Author: | Oliver Keyes |
| Maintainer: | Oliver Keyes <ironholds at gmail.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | yes |
| Materials: | README |
| CRAN checks: | primes results |
| Reference manual: | primes.pdf |
| Package source: | primes_0.1.0.tar.gz |
| Windows binaries: | r-devel: primes_0.1.0.zip, r-release: primes_0.1.0.zip, r-oldrel: primes_0.1.0.zip |
| OS X El Capitan binaries: | r-release: primes_0.1.0.tgz |
| OS X Mavericks binaries: | r-oldrel: primes_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=primes to link to this page.