Learn R Programming

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

numbers (version 0.7-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 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,125

Version

0.7-5

License

GPL (>= 3)

Maintainer

HwB

Last Published

November 26th, 2019

Functions in numbers (0.7-5)

Extended Euclidean Algorithm

Order in Faculty

Legendre and Jacobi Symbol

Mersenne Numbers

Collatz Sequences

Primitive Root Test

Eulers's Phi Function

egyptian_methods

Egyptian Fractions - Specialized Methods

numbers-package

isPrime Property

Number of Prime Factors

pythagorean_triples

Pythagorean Triples

quadratic_residues

Quadratic Residues

Integer Division

Fibonacci and Lucas Series

Farey Approximation

Miller-Rabin Test

Integer N-th Root

Hermite normal form

Hermite Normal Form

Modular Linear Equation Solver

Power Function modulo m

Integer Remainder

Moebius Function

Modular (or: Discrete) Logarithm

List of Divisors

Divisor Functions

Droplet Algorithm for pi and e

egyptian_complete

Egyptian Fractions - Complete Search

Modulo Operator

Necklace and Bracelet Functions

modinv, modsqrt

Modular Inverse and Square Root

Zeckendorf Representation

Arithmetic-geometric Mean

Continous Fractions

Powers of Integers

GCD and LCM Integer Functions

chinese remainder theorem

Chinese Remainder Theorem

Generalized Continous Fractions

Catalan Numbers