numberr

The numberr package contains many algorithms and functions related to number theory. Most functions are written in C++ using Rcpp.

Installation

The Numberr package is currently not on CRAN, thus the best way to install the package in the mean time is to use the devtools package:

library(devtools)
install_github("aaron/numberr")

Available Algorithms and Functions

• Constants and Definitions
  • Catalan's Constant
• Integer Factorization
  • Trial factorization
  • Fermat
  • Pollard's rho
• Binomial Coefficient
  • Recursive, multiplicative and factorial methods
• Factorials
  • Stirling's Approximation
  • Gosper's natural log Approximation
  • Ramanujan's factorial approximation
  • Rising and Falling Factorials
  • Function representations of rising and falling factorials
• Greatest Common Divisor
  • Recursive, division, and subtraction (Euclid) methods
• Least Common Multiple
• Primes and Composite Numbers
  • Coprime integers
  • squares, composites
• Primality Tests
  • Naive method
  • Fermat Test
  • Lucas-Lehmer
• Sequences
  • Catalan
  • Cullen
  • Fibonacci
  • Supercatalan
  • Three-n-One
• Miscellaneous
  • Modular Exponentiation