Difference between revisions of "Manuals/calci/PERMUT"
Jump to navigation
Jump to search
Line 4: | Line 4: | ||
==Description== | ==Description== | ||
*This function gives the number of Permutations for a given number of objects. | *This function gives the number of Permutations for a given number of objects. | ||
− | *A permutation, also called an "arrangement number" or "order, | + | *A permutation, also called an "arrangement number" or "order", is a rearrangement of the elements of an ordered list. |
*A selection of objects in which the order of the objects matters. | *A selection of objects in which the order of the objects matters. | ||
− | *A Permutation is an | + | *A Permutation is an Ordered Combination. |
*In <math>PERMUT(n,nc)</math>, <math>n</math> is an integer which is indicating the number of objects and <math>nc</math> is an integer which is indicating the number of objects in each permutation. | *In <math>PERMUT(n,nc)</math>, <math>n</math> is an integer which is indicating the number of objects and <math>nc</math> is an integer which is indicating the number of objects in each permutation. | ||
− | *For <math>n</math> and <math>nc</math> ,when we | + | *For <math>n</math> and <math>nc</math>, when we give in decimals, it will change into integers. |
− | *The formula for the number of permutation is:<math>_n P_k= \frac {n!}{(n-k)!}</math> | + | *The formula for the number of permutation is: <math>_n P_k= \frac {n!}{(n-k)!}</math> |
*The Permutation is denoted by <math> _nP_k</math>, <math>P_{n,k}</math>, or <math>P(n,k) </math>.This function will give the result as error when | *The Permutation is denoted by <math> _nP_k</math>, <math>P_{n,k}</math>, or <math>P(n,k) </math>.This function will give the result as error when | ||
1.<math>n</math> and <math>nc</math> are non-numeric. | 1.<math>n</math> and <math>nc</math> are non-numeric. |
Revision as of 03:56, 22 January 2014
PERMUT(n,nc)
- and are integers
Description
- This function gives the number of Permutations for a given number of objects.
- A permutation, also called an "arrangement number" or "order", is a rearrangement of the elements of an ordered list.
- A selection of objects in which the order of the objects matters.
- A Permutation is an Ordered Combination.
- In , is an integer which is indicating the number of objects and is an integer which is indicating the number of objects in each permutation.
- For and , when we give in decimals, it will change into integers.
- The formula for the number of permutation is:
- The Permutation is denoted by , , or .This function will give the result as error when
1. and are non-numeric. 2.Suppose or or .
Examples
- =PERMUT(14,2) = 182
- =PERMUT(50,5) = 254251200
- =PERMUT(10.2,3) = 720
- =PERMUT(4,0) = 1
- =PERMUT(6,1) = 6