Returns the number of ordered permutations for a given number of objects.


PERMUT(n, k)

where n and k are integers.
PERMUT returns the number of ordered ways that k objects can be chosen from a set of n objects, where an object can only be chosen once. For example with a set of 3 objects A, B, C, we can choose 2 as follows: AB, AC, BA, BC, CA, CB.
PERMUT calculates:


PERMUT(3, 2)
returns 6, as in the example above.

Created with Zapof