![[R logo]](../../../doc/html/logo.jpg){kind=logo}
![[Up]](../../../doc/html/left.jpg){kind=small}
![[Top]](../../../doc/html/up.jpg){kind=small}
| numbers-package | Number-theoretic Functions for R |
| agm | Arithmetic-geometric Mean |
| chinese | Chinese Remainder Theorem |
| contFrac | Continous Fractions |
| coprime | Coprimality |
| div | Integer Division |
| droplet_e | Droplet for e |
| egyptian_complete | Egyptian Fractions - Complete Search |
| egyptian_methods | Egyptian Fractions - Specialized Methods |
| eulersPhi | Eulers's Phi Function |
| extGCD | Extended Euclidean Algorithm |
| factorize | Prime Factors |
| 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 |
| LCM | GCD and LCM Integer Functions |
| lucas | Fibonacci and Lucas Series |
| mertens | Moebius Function |
| mGCD | GCD and LCM Integer Functions |
| 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 |
| previousPrime | Previous Prime |
| Primes | Prime Numbers |
| primroot | Primitive Root |
| ratFarey | Farey Approximation |
| rem | Integer Remainder |
| sigma | Divisor Functions |
| tau | Divisor Functions |
| twinPrimes | Twin Primes |
| zeck | Zeckendorf Representation |