If the order is important you will have to use this routine. The
same elements in different orders will then be to separate
Draw k of n
ordered N = n!/(n-k)!
Ww!''^«^J •&.* •S^^'!'
/ . , * > " " . ^
The example calculates the number of combinations when
drawing 3 elements from 15 with regard to order.
Here the probability of drawing exactly k X'es from a popu-
lation of n when a elements are drawn at a time without re-
placement is calculated. The probability for the X to b e drawn