Anybody understand how Permutations are applied? Why is it necessary to use that method when there is another way of doing it simpler...
\(\huge\rlap{\color{lime}{\bigstar}}{\color{orange}{\;\bigstar}}\huge\rlap{\color{blueviolet}{\bigstar}}{\color{purple}{\;\bigstar}}\huge\rlap{\color{lightgreen}{\bigstar}}{\color{cyan}{\;\bigstar}}\huge\rlap{\color{turquoise}{\bigstar}}{\color{royalblue}{\;\bigstar}}\huge\rlap{\color{purple}{\bigstar}}{\color{red}{\; \bigstar}}\huge\rlap{\color{#00bfff}{\bigstar}}{\color{goldenrod}{\;\bigstar}}\huge\rlap{\color{goldenrod}{\bigstar}}{\color{yellow}{\;\bigstar}}\huge\rlap{\color{#11c520}{\bigstar}}{\color{magenta}{\;\bigstar}}\huge\rlap{\color{darkgreen}{\bigstar}}{\color{blue}{\;\bigstar}}\huge\rlap{\color{#00bfff}{\bigstar}}{\color{#11c520}{\;\bigstar}}\huge\rlap{\color{lime}{\bigstar}}{\color{yellow}{\;\bigstar}}\huge\rlap{\color{royalblue}{\bigstar}}{\color{red}{\;\bigstar}}\\\Huge\scr\frak\rlap{\color{blue}{Welcome~~to~~OpenStudy!}}{\color{orange}{\;Welcome~~to~~OpenStudy!}}\\\huge\rlap{\color{lime}{\bigstar}}{\color{orange}{\;\bigstar}}\huge\rlap{\color{blueviolet}{\bigstar}}{\color{purple}{\;\bigstar}}\huge\rlap{\color{lightgreen}{\bigstar}}{\color{cyan}{\;\bigstar}}\huge\rlap{\color{turquoise}{\bigstar}}{\color{royalblue}{\;\bigstar}}\huge\rlap{\color{purple}{\bigstar}}{\color{red}{\; \bigstar}}\huge\rlap{\color{#00bfff}{\bigstar}}{\color{goldenrod}{\;\bigstar}}\huge\rlap{\color{goldenrod}{\bigstar}}{\color{yellow}{\;\bigstar}}\huge\rlap{\color{#11c520}{\bigstar}}{\color{magenta}{\;\bigstar}}\huge\rlap{\color{darkgreen}{\bigstar}}{\color{blue}{\;\bigstar}}\huge\rlap{\color{#00bfff}{\bigstar}}{\color{#11c520}{\;\bigstar}}\huge\rlap{\color{lime}{\bigstar}}{\color{yellow}{\;\bigstar}}\huge\rlap{\color{royalblue}{\bigstar}}{\color{red}{\;\bigstar}}\)
Permutations are applied when you have \(n\) objects and need to know how many ways to list \(k\) of them.
They are helpful when analyzing problems.
Sometimes you are using permutations without even realizing it.
In fact, permutations are extremely simple to begin with.
\[ ^{n}P_k = \frac{n!}{(n-k)!} = n(n-1)(n-2)\ldots (n-k+1) \]It's reall
It's really simple.
Thanks :D
the way i remember, permutations are used when order of listing counts, combinations are used when order does not count
Join our real-time social learning platform and learn together with your friends!