How Can We Help?

Counting Sequences

You are here:
< All Topics

Introduction

To calculate the probability of any event, we first need to count the number of all possible outcomes, and the number of favorable outcomes.
Counting efficiently becomes essential to process large amounts of statistical data. The number of outcomes of any event E is written as n(E).

Example: Let E be an event “month of a year”.
Since there are 12 months in a year, n(E) = 12.


The Basic Principle of Counting

The fundamental/ basic rule of counting states that if we have n(A) outcomes associated to event A, and n(B) outcomes of event B, then there will be n(A) * n(B) total outcomes in event A and B combined.
Note that the order in which these experiments are performed does not affect the total number of outcomes.
The basic rule of counting is also known as the Multiplication Rule.
To count the number of outcomes in such cases, we often use a tree diagram. We also use tree structures to often get the complete sample space for the combination of two events.

Example: Let’s say we have two events X and Y.
X : Tossing an unbiased coin.
Y : Rolling a fair dice.
We can sense here, n(X) = 2 and n(Y) = 6.
By using the fundamental principle for counting, we can say that the total number of outcomes for events X and Y combined will be 2*6 = 12.


Replacements and Ordering

Replacement conditions play a crucial role in any counting problem.
There are two such conditions possible for any given counting problem.
1. Sampling with replacement.
2. Sampling without replacement.

Next Introduction to Normal Distribution
Was this article helpful?
0 out of 5 stars
5 Stars 0%
4 Stars 0%
3 Stars 0%
2 Stars 0%
1 Stars 0%
How can we improve this article?
Table of Contents