primes: Fast Functions for Prime Numbers

Fast functions for dealing with prime numbers, such as testing whether a number is prime and generating a sequence prime numbers. Additional functions include finding prime factors and Ruth-Aaron pairs, finding next and previous prime numbers in the series, finding or estimating the nth prime, estimating the number of primes less than or equal to an arbitrary number, computing primorials, prime k-tuples (e.g., twin primes), finding the greatest common divisor and smallest (least) common multiple, testing whether two numbers are coprime, and computing Euler's totient function. Most functions are vectorized for speed and convenience.

Version: 1.1.0
Depends: R (≥ 2.10)
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat
Published: 2020-09-03
Author: Os Keyes [aut, cre], Paul Egeler ORCID iD [aut]
Maintainer: Os Keyes <ironholds at>
License: MIT + file LICENSE
NeedsCompilation: yes
SystemRequirements: C++11
Materials: README
In views: NumericalMathematics
CRAN checks: primes results


Reference manual: primes.pdf
Package source: primes_1.1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release: primes_1.1.0.tgz, r-oldrel: primes_1.1.0.tgz
Old sources: primes archive


Please use the canonical form to link to this page.