Tag: Combinatorics
-
Performs the addition of two long positive integers in the given base.
-
Finds the longest ascending subsequence of a permutation.
-
Returns the number of alternating sign matrices of the given order.
-
Returns a row of the alternating sign matrix triangle.
-
Returns the Bell numbers of order 0 to n.
-
Returns the binomial coefficient using the factorial function.
-
Computes the binomial coefficient with the given arguments.
-
Counts the number of breaks in a permutation.
-
Computes the Catalan numbers, of order 0 to n.
-
Computes the row of the given order in Catalan's triangle.
-
Checks whether an array represents a permutation.
-
Returns the cube root of the argument, which may be negative.
-
Counts the number of cycles in a permutation.
-
Returns the number of derangements of 0 through \e n objects.
-
Calculates the number of derangements of \e n objects.
-
Verifies if a given permutation is a derangement.
-
Computes the row of order \e n in the Euler triangle.
-
Computes the exponential of a squared argument.
-
Exponentiates a number and subtracts 1.
-
Calculates the factorial of an integer number.
-
Calculates the falling factorial with arguments \e x and \e n.
-
Calculates the number of permutations of \e n objects with \e m fixed.
-
Compute the greatest common divisor of two values. <span align="right" style="background-color:99FF99"><strong>Excel: GCD</strong></span>
-
Calculates the inverse of the given permutation.
-
Calculates the inverse of the given permutation.
-
Computes the inversion sequence of a permutation.
-
Calculates the numbers of involutions of 0 through \e n objects.
-
Main Karatsuba recursive algorithm
-
Evaluates the natural logarithm of a number + 1.
-
Calculates the logarithm of the binomial coefficient with given arguments.