numbers v0.7-5
0
Monthly downloads
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 in numbers
| Name | Description | |
| primeFactors | Prime Factors | |
| extGCD | Extended Euclidean Algorithm | |
| ordpn | Order in Faculty | |
| legendre_sym | Legendre and Jacobi Symbol | |
| mersenne | Mersenne Numbers | |
| previousPrime | Previous Prime | |
| coprime | Coprimality | |
| collatz | Collatz Sequences | |
| isPrimroot | Primitive Root Test | |
| eulersPhi | Eulers's Phi Function | |
| egyptian_methods | Egyptian Fractions - Specialized Methods | |
| numbers-package | numbers | |
| isPrime | isPrime Property | |
| omega | Number of Prime Factors | |
| pythagorean_triples | Pythagorean Triples | |
| quadratic_residues | Quadratic Residues | |
| div | Integer Division | |
| fibonacci | Fibonacci and Lucas Series | |
| ratFarey | Farey Approximation | |
| miller_rabin | Miller-Rabin Test | |
| iNthroot | Integer N-th Root | |
| Hermite normal form | Hermite Normal Form | |
| isNatural | Natural Number | |
| modlin | Modular Linear Equation Solver | |
| modpower | Power Function modulo m | |
| rem | Integer Remainder | |
| moebius | Moebius Function | |
| modlog | Modular (or: Discrete) Logarithm | |
| divisors | List of Divisors | |
| Sigma | Divisor Functions | |
| dropletPi | Droplet Algorithm for pi and e | |
| egyptian_complete | Egyptian Fractions - Complete Search | |
| mod | Modulo Operator | |
| necklace | Necklace and Bracelet Functions | |
| primroot | Primitive Root | |
| Primes | Prime Numbers | |
| modinv, modsqrt | Modular Inverse and Square Root | |
| nextPrime | Next Prime | |
| twinPrimes | Twin Primes | |
| zeck | Zeckendorf Representation | |
| agm | Arithmetic-geometric Mean | |
| contFrac | Continous Fractions | |
| isIntpower | Powers of Integers | |
| GCD, LCM | GCD and LCM Integer Functions | |
| chinese remainder theorem | Chinese Remainder Theorem | |
| bell | Bell Numbers | |
| cf2num | Generalized Continous Fractions | |
| catalan | Catalan Numbers | |
| No Results! | ||
Last month downloads
Details
| Type | Package |
| Date | 2019-11-26 |
| License | GPL (>= 3) |
| Repository | CRAN |
| Repository/R-Forge/Project | optimist |
| Repository/R-Forge/Revision | 480 |
| Repository/R-Forge/DateTimeStamp | 2019-11-26 18:32:45 |
| Date/Publication | 2019-11-26 20:10:02 UTC |
| NeedsCompilation | no |
| Packaged | 2019-11-26 18:50:23 UTC; rforge |
| suggests | gmp (>= 0.5-1) |
| depends | R (>= 3.1.0) |
| Contributors | Hans Borchers |
Include our badge in your README
[](http://www.rdocumentation.org/packages/numbers)