Fast Functions for Prime Numbers

Documentation for package ‘primes’ version 1.4.0

coprime	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
cousin_primes	Prime _k_-tuples
gcd	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
generate_n_primes	Generate a Sequence of Prime Numbers
generate_primes	Generate a Sequence of Prime Numbers
is_prime	Test for Prime Numbers
k_tuple	Prime _k_-tuples
lcm	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
next_prime	Find the Next and Previous Prime Numbers
nth_prime	Get the n-th Prime from the Sequence of Primes.
nth_prime_estimate	Prime-counting Functions and Estimating the Value of the n-th Prime
prev_prime	Find the Next and Previous Prime Numbers
primes	Pre-computed Prime Numbers
prime_count	Prime-counting Functions and Estimating the Value of the n-th Prime
primorial	Compute the Primorial
primorial_n	Compute the Primorial
primorial_p	Compute the Primorial
Rgcd	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
Rscm	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
scm	Find the Greatest Common Divisor, Smallest Common Multiple, or Coprimality
sexy_primes	Prime _k_-tuples
sexy_prime_triplets	Prime _k_-tuples
third_cousin_primes	Prime _k_-tuples
twin_primes	Prime _k_-tuples