Learn R Programming

numbers (version 0.9-2)

Number-Theoretic Functions

Description

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.

Copy Link

Version

Install

install.packages('numbers')

Monthly Downloads

20,116

Version

0.9-2

License

GPL (>= 3)

Maintainer

HwB

Last Published

November 20th, 2025

Functions in numbers (0.9-2)

Integer N-th Root

Fibonacci and Lucas Series

Legendre and Jacobi Symbol

Hermite normal form

Hermite Normal Form

Mersenne Numbers

Primitive Root Test

isPrime Property

Number of Prime Factors

N-th root modulo p

Modulo Operator

Necklace and Bracelet Functions

Order in Faculty

Moebius Function

Modular (or: Discrete) Logarithm

Power Function modulo m

numbers-package

tools:::Rd_package_title("numbers")

Modular Linear Equation Solver

modinv, modsqrt

Modular Inverse and Square Root

quadratic_residues

Quadratic Residues

Miller-Rabin Test

Polygonal Numbers

Pascal triangle

Pascal Triangle

Periodic continued fraction

pythagorean_triples

Pythagorean Triples

arithmetic_progression

Arithmetic Progression

Divisor Functions

Stern-Brocot Sequence

Solve Pell's Equation

Zeckendorf Representation

Farey Approximation and Series

Integer Remainder

Bernoulli numbers

Bernoulli Numbers

Generalized Continous Fractions

chinese remainder theorem

Chinese Remainder Theorem

Collatz Sequences

Catalan Numbers

Carmichael numbers

Carmichael Numbers

Arithmetic-geometric Mean

Continued Fractions

egyptian_methods

Egyptian Fractions - Specialized Methods

Eulers's Phi Function

Integer Division

Droplet Algorithm for pi and e

Extended Euclidean Algorithm

egyptian_complete

Egyptian Fractions - Complete Search

GCD and LCM Integer Functions

List of Divisors

Powers of Integers