Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!

Get Started for Free

numbers

Number-Theoretic Functions

Provides number-theoretic functions for factorization, prime numbers, twin primes, primitive roots, modular logarithm and inverses, extended GCD, Farey series and continuous fractions. Includes Legendre and Jacobi symbols, some divisor functions, Euler's Phi function, etc.

Functions (52)

GCD

GCD and LCM Integer Functions

Powers of Integers

agm

Arithmetic-geometric Mean

bell

Bell Numbers

Bernoulli Numbers

Carmichael Numbers

Catalan Numbers

Generalized Continous Fractions

Chinese Remainder Theorem

Collatz Sequences

Continous Fractions

Coprimality

div

Integer Division

List of Divisors

Droplet Algorithm for pi and e

egyptian_complete

Egyptian Fractions - Complete Search

egyptian_methods

Egyptian Fractions - Specialized Methods

Eulers's Phi Function

Extended Euclidean Algorithm

Prime Factors

Fibonacci and Lucas Series

Hermite Normal Form

Integer N-th Root

Natural Number

Primitive Root Test

isPrime Property

legendre_sym

Legendre and Jacobi Symbol

Mersenne Numbers

mod

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

numbers-package

Number-Theoretic Functions

Number of Prime Factors

Order in Faculty

Pascal Triangle

previousPrime

Previous Prime

Prime Numbers

Primitive Root

pythagorean

Pythagorean Triples

quadratic_residues

Quadratic Residues

Miller-Rabin Test

Farey Approximation and Series

rem

Integer Remainder

Divisor Functions

stern_brocot

Stern-Brocot Sequence

Twin Primes

zeck

Zeckendorf Representation

numbers

Number-Theoretic Functions

v0.8-1

GPL (>= 3)

Authors

Hans Werner Borchers

Initial release

2021-04-11

We don't support your browser anymore

Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.