Sloane and Plouffe defined the "super" version of this function, while the number of un-rooted binary trees with a given number of leaves can be found using the "double" version of this function. Brute-force-searching the travelling salesman problem can be done in big O of this function. This function can be approximated as equal to the square root of two pi n times n to the n divided by e to the n, a method devised by Stirling. This function, which is applied to p minus 1 in Wilson's theorem, is most commonly used to find the number of permutations of n objects. Generalized by the gamma function, for 10 points, name this function symbolized by an exclamation point, 
Sloane and Plouffe defined the "super" version of this function, while the number of un-rooted binary trees with a given number of leaves can be found using the "double" version of this function. Brute-force-searching the travelling salesman problem can be done in big O of this function. This function can be approximated as equal to the square root of two pi n times n to the n divided by e to the n, a method devised by Stirling. This function, which is applied to p minus 1 in Wilson's theorem, is most commonly used to find the number of permutations of n objects. Generalized by the gamma function, for 10 points, name this function symbolized by an exclamation point, equal to the product of all integers between 1 and the operand.
Sloane and Plouffe defined the "super" version of this function, while the number of un-rooted binary trees with a given number of leaves can be found using the "double" version of this function.
{factorial}