Man pages for aschleg/numberr
Number-theoretic Algorithms

binomialcoefficientCalculates the binomial coefficient with several different...
factorialFunction for calculating factorials using the standard...
factortrialComputes the factors of an integer, should they exist, using...
fallingfactorialComputes the falling factorial. If the parameter x is a...
fermat_factorComputes the factorization of an integer n by Fermat's...
fibonacciComputes the Fibonacci sequence up to given value of n.
gcdCalculates the Greatest Common Divisor.
gcd_extendedImplementation of the extended form of the Euclidean...
is.compositeTests whether a given value n is composite. Essentially the...
is.coprimeTests if two integers are coprime.
is.evenTests if a given value n is even or not.
is.oddTests whether a given given value n is odd.
is.primeTests whether a given value n is prime
is.squareTests if a given integer is a square number.
pollardrhoImplementation of Pollard's rho algorithm for factorizing an...
ramanujanApproximates the factorial :math:'n!' given an integer...
risingfactorialComputes the rising factorial. Also known as the Pochhammer...
stirlingApproximates a factorial of an integer n using Stirling's...
stirlinglnApproximates the factorial of n using the approximation given...
three_n_oneComputes the famous 3n + 1 sequence, also known as the...
aschleg/numberr documentation built on Sept. 26, 2017, 10:29 p.m.