permutations()

Calculates the number of permutations that can be achieved by drawing k elements from n elements available.

syntax

 permutations ( n: integer, k: integer) : integer 

Calculates the number of possible combination in every order possible. If you need to count every possible combination just once, see combinations().

parameters

return
number of possible combinations regarding order of elements

example
Find the number of Headmaster-Substitute-Teams (two people, it matters who gets assigned first) out of a set of three people available:
permutations( 3, 2 ) returns 6.