.
nCk is the number of Combinations of n items taken k at a time.
= .
nPk is the number of Permutations of k items taken from the set of n elements
= n*(n-1)*(n-2)* . . . * (n-k+1).
We consider combinations when we select the groups of k items from the set of n items without looking on their order (when the order does not matter).
We consider permutations when we select the groups of k items from the set of n items and consider these groups as ordered sets (when the order does matter).
Again, or one more time:
nCk is the number of all subsets of k elements of a given set of n elements.
nPk is the number of all ordered subsets of k elements of a given set of n elements.
----------------
On Combinations and Permutations see the lessons
- Introduction to Permutations
- PROOF of the formula on the number of Permutations
- Problems on Permutations
- Introduction to Combinations
- PROOF of the formula on the number of Combinations
- Problems on Combinations
- OVERVIEW of lessons on Permutations and Combinations
in this site.
Also, you have this free of charge online textbook in ALGEBRA-II in this site
- ALGEBRA-II - YOUR ONLINE TEXTBOOK.
The referred lessons are the part of this online textbook under the topic "Combinatorics: Combinations and permutations".
Save the link to this textbook together with its description
Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson
into your archive and use when it is needed.