Difference between revisions of "Manuals/calci/PERMUT"

Revision as of 01:51, 6 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 are giving in to decimals it will change in to 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},orP(n,k)$ .This function will give the result as error when

1.n and nc are nonnumeric.
2.Suppose  $n\leq 0ornc<0orn<nc$ .

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

@@ Line 11: / Line 11: @@
 *For n and nc ,when we are giving in to decimals it will change in to integers.
 *The formula for the number of permutation is:<math>_n P_k= \frac {n!}{(n-k)!}</math>
-*The Permutation is denoted by _nP_k, P_{n,k}, or P(n,k).This function will give the result as error when
+*The Permutation is denoted by <math> _nP_k, P_{n,k}, or P(n,k) </math>.This function will give the result as error when
 .n and nc are nonnumeric.
-.Suppose n<=0 or nc<0 or n<nc.
+.Suppose <math> n\le 0 or nc<0 or n<nc</math>.
 ==Examples==