# Man pages for aschleg/numberrNumberr is a package containing number-theoretic algorithms and functions primarily written in C++ using Rcpp

 binomial_coefficient Calculates the binomial coefficient with several different... binomial_factorial Calculates the binomial coefficient using the factorial... binomial_multiplicative Calculates the binomial coefficient using the multiplicative... binomial_recursive Calculates the binomial coefficient using a recursive method. catalan Returns the Catalan numbers up to n. catalans_constant Approximates Catalan's Constant, K. collatz Computes the famous 3n + 1 sequence, also known as the... cullen Returns the Cullen number integer sequence up to a given... factorial Function for calculating factorials using the standard... factor_trial Computes the factors of an integer, should they exist, using... fallingfactorial Computes the falling factorial. fallingfactorial_function Computes the falling factorial function as a string. fermat_factor Computes the factorization of an integer n by Fermat's... fermat_prime Tests if an integer is (probably) prime using the Fermat... fibonacci Computes the Fibonacci sequence up to given value of n. gcd Computes the greatest common divisor with several algorithms... gcd_division Calculates the Greatest Common Divisor using the Euclidean... gcd_extended Implementation of the extended form of the Euclidean... gcd_recursive Calculates the Greatest Common Divisor of two integers using... gcd_subtraction Computes the Greatest Common Divisor of two integers using... iscomposite Tests whether a given value n is composite. Essentially the... iscoprime Tests if two integers are coprime. iseven Tests if a given value n is even or not. isodd Tests whether a given given value n is odd. isprime Tests whether a given value n is prime with a naive test. issquare Tests if a given integer is a square number. lcm Computes the least common multiple of two integers, a and b. lucas_lehmer Performs the Lucas-Lehmer primality test for determining if a... mod_expo Computes large modular exponents with modular exponentiation. numberr-package A short title line describing what the package does pollardrho Implementation of Pollard's rho algorithm for factorizing an... ramanujan Approximates the factorial :math:'n!' given an integer... risingfactorial Computes the rising factorial. Also known as the Pochhammer... risingfactorial_function Computes the rising factorial, also known as the Pochhammer... stirling Approximates a factorial of an integer n using Stirling's... stirlingln Approximates the factorial of n using the approximation given... supercatalan Returns the super-Catalan number sequence up to the given...
aschleg/numberr documentation built on Feb. 17, 2018, 2:49 p.m.