Similarly, in an experiment involving the tossing of six coins, the total possible outcomes are
(2) × (2) × (2) × (2) × (2) × (2) = 64
5.4.2Counting Rules for Combinations
The second counting method uses the concept of combinations. Sampling of n items from a population
of size N (usually larger) without replacement provides
!
(,)
!()!()
==
−
N
n
N
CCNn
Nnn
where !N = (N) × (N–1) × (N – 2) ×
…
× (2) × (1)
!n = (n) × (n – 1) × (n – 2) ×
…
× (2) × (1)
and !0 = 1
The term factorial is represented by the symbol “!”. For example, !4 = 4 × 3 × 2 × 1 = 24. Example 5.1
specically explains the concept of counting rules ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.