Changes

==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," 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 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.

*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  

*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.