Description Computes the number of combinations possible by taking k items at a time from a pool of n, where order in the sample taken is important.
For example, in a box of four different items, the number of combinations possible taking out 2 items at a time is 12; that is, the twelve combinations of items 1-2, 1-3, 1-4, 2-1, 2-3, 2-4, 3-1, 3-2, 3-4, 4-1, 4-2, and 4-3.
Syntax PERMUT ( number, chosen)
| Argument | Description |
|---|---|
| number | A positive integer representing the total number of items in the pool of items. Decimal numbers are truncated to integers. |
| chosen | A positive integer representing the number of items taken from the pool at a time. It must be less than or equal to number. Decimal values are truncated to integers. |
Remarks This function is similar to the COMBIN function, except that PERMUT requires the samples to be ordered, while COMBIN takes samples in any order.
Equation
where n is the total number of items and k is the number of items taken at a time.
Examples This function returns 12:
PERMUT(4,2)
This function returns 30240:
