Number-Theoretic Functions
Integer N-th Root
Powers of Integers
Natural Number
isPrime Property
Primitive Root Test
Legendre and Jacobi Symbol
Mersenne Numbers
Modulo Operator
Modular Inverse and Square Root
Modular Linear Equation Solver
Modular (or: Discrete) Logarithm
Power Function modulo m
Moebius Function
Necklace and Bracelet Functions
Next Prime
tools:::Rd_package_title("numbers")
Number of Prime Factors
Order in Faculty
Pascal Triangle
Arithmetic-geometric Mean
Bell Numbers
Bernoulli Numbers
Carmichael Numbers
Catalan Numbers
Generalized Continous Fractions
Chinese Remainder Theorem
Collatz Sequences
Continued Fractions
Coprimality
Integer Division
List of Divisors
Droplet Algorithm for pi and e
Egyptian Fractions - Complete Search
Egyptian Fractions - Specialized Methods
Eulers's Phi Function
Extended Euclidean Algorithm
Prime Factors
Fibonacci and Lucas Series
GCD and LCM Integer Functions
Hermite Normal Form
Periodic continued fraction
Previous Prime
Prime Numbers
Primitive Root
Pythagorean Triples
Quadratic Residues
Miller-Rabin Test
Farey Approximation and Series
Integer Remainder
Divisor Functions
Solve Pell's Equation
Stern-Brocot Sequence
Twin Primes
Zeckendorf Representation
Provides number-theoretic functions for factorization, prime numbers, twin primes, primitive roots, modular logarithm and inverses, extended GCD, Farey series and continued fractions. Includes Legendre and Jacobi symbols, some divisor functions, Euler's Phi function, etc.