Package: primes
Type: Package
Title: Fast Functions for Prime Numbers
Version: 1.6.1
Date: 2025-01-28
Authors@R: c(
    person("Os", "Keyes", email = "ironholds@gmail.com", role = c("aut")),
    person("Paul", "Egeler", email = "paulegeler@gmail.com", role = c("aut", "cre"), comment = c(ORCID = "0000-0001-6948-9498"))
    )
Description: 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.
License: MIT + file LICENSE
Depends: R (>= 4.0)
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat
URL: https://github.com/ironholds/primes
BugReports: https://github.com/ironholds/primes/issues
RoxygenNote: 7.2.3
Encoding: UTF-8
LazyData: true
NeedsCompilation: yes
Packaged: 2025-02-04 04:18:09 UTC; pablo
Author: Os Keyes [aut],
  Paul Egeler [aut, cre] (<https://orcid.org/0000-0001-6948-9498>)
Maintainer: Paul Egeler <paulegeler@gmail.com>
Repository: CRAN
Date/Publication: 2025-02-04 08:10:02 UTC
Built: R 4.6.0; x86_64-apple-darwin20; 2026-04-26 21:14:27 UTC; unix
Archs: primes.so.dSYM
