# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "primes" in publications use:'
type: software
license: MIT
title: 'primes: Fast Functions for Prime Numbers'
version: 1.6.0
doi: 10.32614/CRAN.package.primes
abstract: 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.
authors:
- family-names: Keyes
  given-names: Os
  email: ironholds@gmail.com
- family-names: Egeler
  given-names: Paul
  email: paulegeler@gmail.com
  orcid: https://orcid.org/0000-0001-6948-9498
repository: https://ironholds.r-universe.dev
repository-code: https://github.com/ironholds/primes
commit: 915c26c5c4df95a3f308f4e3fc5cd2e726e393ed
url: https://github.com/ironholds/primes
date-released: '2023-12-30'
contact:
- family-names: Keyes
  given-names: Os
  email: ironholds@gmail.com