Learn R Programming

⚠️There's a newer version (0.8-5) of this package.Take me there.

numbers (version 0.7-1)

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 continuous fractions. Includes Legendre and Jacobi symbols, some divisor functions, Euler's Phi function, etc.

Copy Link

Version

Install

install.packages('numbers')

Monthly Downloads

9,988

Version

0.7-1

License

GPL (>= 3)

Maintainer

HwB

Last Published

May 17th, 2018

Functions in numbers (0.7-1)

Integer N-th Root

Extended Euclidean Algorithm

Divisor Functions

Primitive Root Test

Modular (or: Discrete) Logarithm

Number of Prime Factors

Power Function modulo m

Order in Faculty

isPrime Property

Legendre and Jacobi Symbol

Necklace and Bracelet Functions

Modular Linear Equation Solver

Modular Inverse

Moebius Function

numbers-package

Farey Approximation

Modulo Operator

pythagorean_triples

Pythagorean Triples

Mersenne Numbers

Zeckendorf Representation

Integer Remainder

quadratic_residues

Quadratic Residues

Miller-Rabin Test

Arithmetic-geometric Mean

GCD and LCM Integer Functions

Hermite normal form

Hermite Normal Form

chinese remainder theorem

Chinese Remainder Theorem

Generalized Continous Fractions

Fibonacci and Lucas Series

Eulers's Phi Function

Continous Fractions

Catalan Numbers

Integer Division

egyptian_methods

Egyptian Fractions - Specialized Methods

List of Divisors

Powers of Integers

egyptian_complete

Egyptian Fractions - Complete Search

Droplet Algorithm for pi and e