Returns the number of permutations of n elements to k-th order without repetition.
Permut(n, k)
n,k:integer expression
Permut is defined as
Permut(n,k) = n!/(n-k)!.
OpenW # 1
Print Permut(6, 2) // Prints 30
If k > n an error is reported.
{Created by Sjouke Hamstra; Last updated: 21/10/2014 by James Gaite}