Difference between revisions of "Manuals/calci/PERMUT"

Revision as of 02:56, 22 January 2014

PERMUT(n,nc)

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 $PERMUT(n,nc)$ , $n$ is an integer which is indicating the number of objects and $nc$ is an integer which is indicating the number of objects in each permutation.
For $n$ and $nc$ , when we give in decimals, it will change into integers.
The formula for the number of permutation is: $_{n}P_{k}={\frac {n!}{(n-k)!}}$
The Permutation is denoted by $_{n}P_{k}$ , $P_{n,k}$ , or $P(n,k)$ .This function will give the result as error when

1. $n$  and  $nc$  are non-numeric.
2.Suppose  $n\leq 0$   or   $nc<0$  or  $n<nc$ .

=PERMUT(14,2) = 182
=PERMUT(50,5) = 254251200
=PERMUT(10.2,3) = 720
=PERMUT(4,0) = 1
=PERMUT(6,1) = 6

@@ Line 4: / Line 4: @@
 ==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 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.
+*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.
-*For <math>n</math> and <math>nc</math> ,when we are giving in to decimals it will change in to integers.
+*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
 .<math>n</math> and <math>nc</math> are non-numeric.