The PERMUT function returns the number of permutations without repetition for a set of elements selected in blocks of a certain size.
PERMUT(
number,
number_chosen
)
- number: Total number of elements.
- number_chosen: Number of elements to consider in each permutation.
The PERMUT function returns an integer.
The formula used to calculate the number of permutations is:
If either of the two arguments are not integers, they are truncated.
If either of the two arguments are not numbers, the function returns an error of type #VALUE!.
If number <= 0 or number_chosen <0, PERMUT returns a #NUM! error.
If number_chosen < number, PERMUT returns a #NUM! error.
If we have a set of 4 elements (A, B, C and D) and we wanted to group them two by two, the possible permutations would be the following:
- AB
- AC
- AD
- BA
- BC
- BD
- CA
- CB
- CD
- DA
- DB
- DC
...for a total of 12 possibilities. This number would be calculable using the PERMUT function with the following measure:
Num. permutaciones = PERMUT(4, 2)
