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.

Author | Oliver Keyes |

Date of publication | 2015-06-22 19:53:27 |

Maintainer | Oliver Keyes <ironholds@gmail.com> |

License | MIT + file LICENSE |

Version | 0.1.0 |

primes

primes/tests

primes/tests/testthat.R

primes/tests/testthat

primes/tests/testthat/test_primality.R

primes/src

primes/src/primes.cpp

primes/src/RcppExports.cpp

primes/NAMESPACE

primes/R

primes/R/primes.R
primes/R/RcppExports.R
primes/README.md

primes/MD5

primes/DESCRIPTION

primes/man

primes/man/prime.Rd
primes/man/primes.Rd
primes/LICENSE

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

Please suggest features or report bugs with the GitHub issue tracker.

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