Loading
Progresso di Studio
Across all your exams
Taught in English
Questo esame si sostiene in inglese: le lezioni e le domande sono in inglese. L'interfaccia resta in italiano.
Drag to pan · ⌘/Ctrl + scroll or pinch to zoom · tap a node for detail · +/− to expand a branch
Part 1 of 1
The fundamental counting principle states that if task 1 has m outcomes and task 2 has n outcomes, the sequential process has m * n outcomes. When multiple independent tasks are performed in sequence, total outcomes multiply.
Permutations (order matters): P(n, k) = n! / (n - k)!. Combinations (order does NOT matter): C(n, k) = n! / (k! (n - k)!). For example, selecting a committee of 3 from 8 people uses C(8, 3) = (8 * 7 * 6) / (3 * 2 * 1) = 56.
Worked example
Calculate the number of ways to choose 2 representatives from a group of 6 students. Order does not matter, so use combinations: C(6, 2) = 6! / (2! * 4!) = (6 * 5) / 2 = 15 distinct pairs.
1.Combinations C(n, k) are used when the selection order does not matter.
2.The value of C(5, 2) is equal to 20.
3.The number of distinct arrangements of 4 different books on a shelf is 24.
Gain full lifetime access to all 3 lessons in Mathematics, interactive MindMaps, step-by-step solved questions, and full timed mock exams for CEnT-S.
Unlock Full CEnT-S Pass (€29)