| numbers-package | Number-Theoretic Functions for R |
| agm | Arithmetic-geometric Mean |
| atkin_sieve | Prime Numbers |
| bell | Bell Numbers |
| catalan | Catalan Numbers |
| chinese | Chinese Remainder Theorem |
| contFrac | Continous Fractions |
| coprime | Coprimality |
| div | Integer Division |
| dropletE | Droplet Algorithm for pi and e |
| dropletPi | Droplet Algorithm for pi and e |
| egyptian_complete | Egyptian Fractions - Complete Search |
| egyptian_methods | Egyptian Fractions - Specialized Methods |
| eulersPhi | Eulers's Phi Function |
| extGCD | Extended Euclidean Algorithm |
| fibonacci | Fibonacci and Lucas Series |
| GCD | GCD and LCM Integer Functions |
| hermiteNF | Hermite Normal Form |
| isIntpower | Powers of Integers |
| isNatural | Natural Number |
| isPrime | isPrime Property |
| jacobi_sym | Legendre and Jacobi Symbol |
| LCM | GCD and LCM Integer Functions |
| legendre_sym | Legendre and Jacobi Symbol |
| lucas | Fibonacci and Lucas Series |
| mersenne | Mersenne Numbers |
| mertens | Moebius Function |
| mGCD | GCD and LCM Integer Functions |
| miller_rabin | Miller-Rabin Test |
| mLCM | GCD and LCM Integer Functions |
| mod | Modulo Operator |
| modinv | Modular Inverse |
| modlin | Modular Linear Equation Solver |
| modorder | Power Function modulo m |
| modpower | Power Function modulo m |
| moebius | Moebius Function |
| nextPrime | Next Prime |
| Omega | Number of Prime Factors |
| omega | Number of Prime Factors |
| ordpn | Order in Faculty |
| previousPrime | Previous Prime |
| primeFactors | Prime Factors |
| Primes | Prime Numbers |
| primroot | Primitive Root |
| pythagorean_triples | Pythagorean Triples |
| quadratic_residues | Quadratic Residues |
| radical | Prime Factors |
| ratFarey | Farey Approximation |
| rem | Integer Remainder |
| Sigma | Divisor Functions |
| tau | Divisor Functions |
| twinPrimes | Twin Primes |
| zeck | Zeckendorf Representation |