PERMUTATION

INTRODUCTION

A set V comprises of n components if its components can be tallied 1, 2,..., n. As it were, the set V can be carried into a 1-1 correspondence with the set {1, 2, ..., n}. Frequently it's more advantageous to begin numbering from 0. At that point we get the set {0, 1, 2, ..., n-1}.

DEFINITION

The quantity of changes of an arrangement of n components is signified n! (affirmed n factorial.)

Ways:

1! = 1 ways
2! = 2 ways
3! = 6 ways
4! = 24 ways
5! = 120 ways
6! = 720 ways
7! = 5,040 ways
8! = 40,320 ways

EXPLANATION

i'm going to pick number 8 and why 8! the answer is 40,320?
It is simple, you just have to expand it for example 8*7*6*5*4*3*2*1* and the answer will be 40,320.

Symbols:

P! = Permutation
N! = Number selected
R! = Object from total

EXAMPLES:

VIDEO

REFERENCES

(https://www.youtube.com/watch?v=DROZVHObeko)
(http://www.careerarm.com/wp-content/uploads/2015/07/p-and-c-1.png)
(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiKQMGTR0WnThQumZXMKd_aqnres05DhFGFdfvKjBAQkTJu8vBDOA0qBAAW9FUkmHAe6DXGZqlAnj4OxUf7Qud5Wd29CR5-q2-FGYS7-jTsIFgEEq4XQw_0lvWRmIfDoEebeltFDFEoMXk/s1600/permutation%201.JPG)
(https://i.ytimg.com/vi/0WDUWCtxM1U/maxresdefault.jpg) (http://www.cut-the-knot.org/do_you_know/permutation.shtml)