Author: lucian
-
Adaptive integration algorithm using RMS formulae
-
Returns the number of alternating sign matrices of the given order.
-
Computes the binomial coefficient with the given arguments.
-
Counts the number of breaks in a permutation.
-
Calculates the minimum of a one-dimensional real function using Brent's method.
-
Checks whether an array represents a permutation.
-
Calculates the number of derangements of \e n objects.
-
Evaluates the inverse of the complementary error function.
-
Evaluates the inverse of the error function.
-
Calculates the decomposition of a positive integer into primes.
-
Calculates the decomposition of a positive integer into primes.
-
Calculates the number of permutations of \e n objects with \e m fixed.
-
Returns true if the computer architecture is Big Endian, false otherwise.
-
Calculates the natural logarithm of the Gamma function with argument \e x.
-
Returns the round off unit for double precision arithmetic.
-
Calculates the Morse-Thue number of the given order.
-
Calculates the multinomial coefficient with the given arguments.
-
Calculates the multinomial coefficient with the given arguments.
-
Calculates the pentagonal number of the given order.
-
position of an object moving uniformly
-
position of an object moving uniformly
-
Computes the rank of the given permutation, as generated by Permutation Class 2.
-
Evaluates the Owen's T function.
-
Evaluates the Trigamma function.
-
Calculates the Young tableau number of the given order.
CodeCogs®