Package: primes
Type: Package
Title: Fast Functions for Prime Numbers
Version: 1.6.0
Date: 2023-12-30
Authors@R: c(
    person("Os", "Keyes", email = "ironholds@gmail.com", role = c("aut", "cre")),
    person("Paul", "Egeler", email = "paulegeler@gmail.com", role = c("aut"), 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.1.0)
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat
URL: https://github.com/ironholds/primes
BugReports: https://github.com/ironholds/primes/issues
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.2.3
Encoding: UTF-8
LazyData: true
Repository: https://ironholds.r-universe.dev
Date/Publication: 2024-01-16 15:57:48 UTC
RemoteUrl: https://github.com/ironholds/primes
RemoteRef: HEAD
RemoteSha: 915c26c5c4df95a3f308f4e3fc5cd2e726e393ed
NeedsCompilation: yes
Packaged: 2026-07-04 16:51:35 UTC; root
Author: Os Keyes [aut, cre],
  Paul Egeler [aut] (ORCID: <https://orcid.org/0000-0001-6948-9498>)
Maintainer: Os Keyes <ironholds@gmail.com>