Learn R Programming

numbers (version 0.8-5)

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

9,999

Version

0.8-5

License

GPL (>= 3)

Maintainer

Last Published

November 23rd, 2022

Functions in numbers (0.8-5)

Catalan Numbers

GCD and LCM Integer Functions

Powers of Integers

Collatz Sequences

Generalized Continous Fractions

chinese remainder theorem

Chinese Remainder Theorem

Arithmetic-geometric Mean

Bernoulli numbers

Bernoulli Numbers

Carmichael numbers

Carmichael Numbers

List of Divisors

Extended Euclidean Algorithm

egyptian_complete

Egyptian Fractions - Complete Search

Droplet Algorithm for pi and e

egyptian_methods

Egyptian Fractions - Specialized Methods

Eulers's Phi Function

Continued Fractions

Integer Division

Integer N-th Root

Primitive Root Test

isPrime Property

numbers-package

tools:::Rd_package_title("numbers")

Fibonacci and Lucas Series

Hermite normal form

Hermite Normal Form

Modular Linear Equation Solver

Modulo Operator

Modular (or: Discrete) Logarithm

modinv, modsqrt

Modular Inverse and Square Root

Number of Prime Factors

Periodic continued fraction

Pascal triangle

Pascal Triangle

Order in Faculty

Integer Remainder

quadratic_residues

Quadratic Residues

Mersenne Numbers

Power Function modulo m

Solve Pell's Equation

pythagorean_triples

Pythagorean Triples

Stern-Brocot Sequence

Legendre and Jacobi Symbol

Moebius Function

Zeckendorf Representation

Divisor Functions

Farey Approximation and Series

Necklace and Bracelet Functions

Miller-Rabin Test