Probability

Master permutations and combinations with real-life examples! This comprehensive Permutation Combination Quiz covers factorial concepts, combination formulas (${}^nC_r$), permutation calculations (${}^nP_r$), probability fundamentals, and practical applications like committee selections, password combinations, handshake problems, and race podium outcomes. Test your understanding of counting principles through 20 MCQs with detailed explanations—perfect for GMAT, GRE, SAT, JEE, and competitive exam preparation. Let us start with the Online Permutation Combination Quiz now.

Online Permutation Combination Quiz with Answers

• In general, “$n$ factorial” represents?
• The factorial of zero is
• The factorial of 8 is
• The factorial of (14 – 8) is
• The factorial of (8 – 8) is
• The factorial of (4 – 0) is
• The number of combinations for selecting 7 elements from 10 distinct elements is
• The number of combinations for selecting zero elements from 7 distinct elements is
• The number of combinations for selecting 9 elements from 9 distinct elements is
• A Jury of five persons will be randomly selected from a group of 15 persons. The total number of combinations is:
• An investor will randomly select six stocks from 18 stocks for investment purposes. The total number of combinations is
• You are setting a 4-digit smartphone passcode where digits can repeat. How many different possible passcodes are there?
• A club with 10 members needs to form a committee of 3 people to plan an event. How many different committees are possible?
• In a race with 8 runners, how many different ways can the gold, silver, and bronze medals be awarded (assuming no ties)?
• A pizza shop offers 12 distinct toppings. For a 3-topping pizza, how many different combinations can you order?
• A classic car license plate format consists of 2 different letters (A-Z, no I or O) followed by 4 different digits (0-9). How many such plates can be made?
• You have 5 different books and want to arrange 3 of them on a shelf from left to right. How many arrangements are possible?
• At the start of a meeting, each of the 7 people shakes hands once with every other person. How many handshakes occur?
• A lunch special allows you to choose 1 of 4 sandwiches, 1 of 3 sides, and 1 of 2 drinks. How many distinct lunch plates are possible?
• A project team has 6 members: Alex, Bailey, Charlie, Dakota, Elliot, and Finley. They need to select a subcommittee of 2 people to handle logistics and another distinct subcommittee of 2 people to handle publicity. No person can serve on both subcommittees. How many different ways can these two subcommittees be formed?

Learn R Programming Language

In the post we will discuss about “What are Mutually Exclusive Events? Define it with an example and also explain the classic definition of probability.” In every daily life, we use mutual exclusivity:

• Sports: A team wins, loses, or ties (mutually exclusive outcomes)
• Will it rain or not today? (simplified as mutually exclusive)
• Should I take the job in City A or City B? (mutually exclusive choices)

Definition: Mutually Exclusive Events

Two events are mutually Exclusive (or disjoint events) if it is impossible for them to occur together (that is, they cannot occur at the same time). Mathematically, two events $A$ and $B$ will be mutually exclusive events if and only if

$$A \cap B = \phi$$

In probability sense $$P(A\cap B)=0$$

Example: Mutually Exclusive Events

Consider the experiment of rolling a die once. The Sample space $S = \{1, 2, 3, 4, 5, 6\}$. Let the

Event $A$ = ‘observe an odd number’ = {1, 3, 5}

Event $B$ = ‘observe an even number’ = {2, 4, 6}

The intersection of both Events $A\cap B = \phi$ (the empty set), so Events $A$ and $B$ are mutually exclusive events.

\begin{align*}
A \cap B &= \{1, 3, 5\} \cap \{2, 4, 6\}\\
& = \phi
\end{align*}

Classical Definition of Probability

If a random experiment can produce $n$ mutually exclusive and equally likely outcomes, and if $m$ out to these outcomes are considered favorable to the occurrence of a certain event $A$, then the probability of the event $A$, denoted by $P(A)$, is defined as the ratio $\frac{m}{n}$.

$$P(A)= \frac{m}{n}$$

Connection between Mutually Exclusive Events and Classical Probability

In the classic definition, when calculating $P(A\cup B)$ for mutually exclusive events, $m$ for the union is simply $m_A + m_B$​, because no outcome is counted twice. This fits with $P(A\cup B) = P(A) + P(B)$ in the mutually exclusive case.

Mutually Exclusive Events Advanced Examples

Example 1: Poisson Process

In a Poisson process with rate $\lambda$, the probability of observing exactly $k$ events in time interval $t$ is:

$$P(X=k)=\frac{(\lambda 6)^{k}e^{-\lambda t}}{k!}$$​

The events $X=i$ and $X=j$ for $i\ne j$ are mutually exclusive because the number of events in a fixed interval cannot be both $i$ and $j$ simultaneously.

Application: Queuing theory (number of customers arriving at a bank in 5 minutes).

Example 2: Signal Detection in Communications

In digital communications, a receiver might detect:

• $A_1$​: Signal “0” was sent
• $A_2$​: Signal “1” was sent
• $A_3$​: Signal “2” was sent (for M-ary modulation)

These are mutually exclusive at the transmission end (only one symbol sent at a time), but at the receiver, noise might cause overlap in the observation space. The transmitted symbols are mutually exclusive events, while received voltage ranges may not be.

Application: Designing error-correcting codes by calculating probability of symbol error:

$$P_e=1-P(correct\,\, detection)$$

where $P(correct\,\,detection)=\sum\limits_i ​P(A_i​)P(decide\,\, i|A_i\,\,​ sent)$.

Example 3: Partitioning a Sample Space

In Bayesian inference, a set of hypotheses $\{H_1​,H_2​,\cdots,H_n​\}$ forms a mutually exclusive and exhaustive partition:

$$H_i \cap H_j = \phi\quad (i \ne j), \quad \bigcup\limits_{i=1}^n H_i = \Omega$$

Then for any event $E$:

$$P(E) = \sum\limits_{i=1}^n P(E|H_i)P(H_i)$$

This is the law of total probability, crucial in medical testing, machine learning classifiers, etc.

Why Study Mutually Exclusive Events?

Reason	Practical Implication
Calculation Simplicity	Enables direct addition of probabilities
Real-World Modeling	Many natural scenarios involve exclusive outcomes
Avoiding Errors	Prevents double-counting in probability sums
Statistical Foundation	Essential for hypothesis testing and inference
Decision Making	Framework for choosing between alternatives
Advanced Theory	Foundation for measure-theoretic probability

Mutually exclusive events are not just a mathematical curiosity: they are a fundamental building block for reasoning about uncertainty, making decisions under constraints, and modeling real-world systems where choices or outcomes exclude each other. Without this concept, we could not properly analyze risks, design reliable systems, or even make sense of everyday probabilistic reasoning.

Summary

Concept	Meaning	Formula (example case)
Mutually Exclusive Events	Cannot happen at the same time	$P(A\cap B)=0$
Classic Probability	Ratio of favorable to total equally likely outcomes	$P(A) = \frac{favourable}{Total}$

FAQs

• What is meant by mutually exclusive events?
• Define classical probability?
• Give practical examples of mutually exclusive experiments and events.
• What is the connection between probability and mutually exclusive experiment/events.

Learn R Programming

In its simplest form, the Fundamental Counting Principle (also known as the Multiplication Principle) states:

If one event can occur in $m$ ways and a second event can occur independently in $n$ ways, then the total number of ways the two events can occur together is $m \times n$.

Fundamental Counting Principle for $k$ events

The Fundamental Counting Principle can be extended to any number of events. For $k$ independent events, where the first event has $n_1$ outcomes, the second has $n_2, \cdots$, and the k-th has $n_k$ outcomes, the total number of possible outcomes is:

Total Outcomes = $n_1 \times n_2 \times \cdots n_k$

In simple the fundamental counting principle can be stated as “The total number of outcomes for any process which occurs in sequential steps is equal to the product of the number of outcomes for each step.”

Condition

The important condition of the fundamental counting principles is that the choices must be independent (that is, events must be independent). This means the outcome of the first choice does not restrict or change the possibilities for the subsequent choices.

Real Life Examples

The following are a few everyday examples to build intuition.

• Outfit Selection: Suppose Event 1 is choosing a shirt, and there are 4 different shirts. Event 2 is choosing pants. There are 3 different pants. One can calculate total outfits: since the choice of shirt and pants are independent, one can create $4\times 3 = 12$ different outfits.
• Restaurant Meal: Suppose Event 1 is choosing an appetizer, there are 3 options. For Event 2, choosing a main course, there are 5 options, and for Event 3, choosing a dessert, there are 2 options. The Total number of three course-meals is $3\times 5\times 2 = 30$.
• Computer Password: Consider a 4-digit PIN code where each digit can be from 0 to 9. For each digit, there are 10 possibilities. The total PINs will be $10\times 10\times 10 \times 10 = 10,000$.

Applications of FCP for Statisticians, Data Analysts, and Data Scientists

The Fundamental Counting Principle is not just for counting outfits; it is the mathematical bedrock for calculating probabilities, designing experiments, and understanding data complexity.

For Statistician

• Calculating Simple Probabilities: The Fundamental Counting Principle is used to determine the size of the sample space. Probability is then calculated as $\frac{Favourable\, Outcomes}{Total\, Possible\, Outcomes}$. For example, one can compute the probability of getting two heads in two coin tosses. The total possible outcomes of this experiment are $2 \times 2 = 4 (HH, HT, TH, TT)$. The favourable outcomes are $1 (HH)$. The probability will be $\frac{1}{4} = 0.25$
• Design of Experiments: When designing experiments to test multiple factors, a statistician uses the Fundamental Counting Principle to determine the total number of experimental runs needed. For example, a pharmaceutical company wants to test a new drug. They have: Factor 1: Dosage (3 levels: low, medium, and high). Factor 2: Age Group (2 levels: young and old) and Factor 3: Gender (2 levels: male and female). To test every possible combination (a full factorial design), they would need $3\times 2\times 2=12$ distinct experimental groups. The FCP tells them the scale of the experiment upfront.

For Data Analysts

• Assessing Data Volume and Cardinality: Data analysts utilize the Fundamental Counting Principle to comprehend the potential uniqueness of records within a dataset, which is essential for data profiling. For example, an analyst is looking at a customer table with Region, Customer Segment, and Product Category fields. If there are 5 regions, 4 segments, and 10 categories, the FCP shows there are $5 \times 4 \times 10=200$ potential unique combinations. If the actual data only has 150 combinations, the analyst knows that some theoretical combinations are missing, which could be an insight or a data quality issue.
• Planning for Data Visualization: When creating dashboards with multiple interactive filters, the Fundamental Counting Principle helps anticipate all the possible “views” a user might create, ensuring the underlying data model can support them efficiently.

For Data Scientists

• Feature Engineering & Combinatorial Features: Data scientists often create new features by combining existing ones. The FCP warns data scientists about the “Curse of dimensionality” that can result. For example, a model uses Country (50 values) and Job Title (100 values). If a data scientist one-hot encodes these, they get $50+100=150$ new columns. However, if they create a cross-feature $Country_{JobTitle}$, the FCP shows they could end up with $50\times 100 = 5000$ new columns. This explosion in features can lead to overfitting and requires techniques like regularization or embedding layers in neural networks.
• Designing A/B/n Tests: Modern A/B tests often go beyond two variants (A and B). For example, a company wants to test: Element 1: Headline (3 versions), Element 2: Button Color (2 versions), and Element 3: Hero Image (2 versions). The FCP shows that to test all combinations, they would need $3\times 2\times 2 = 12$ different versions of the webpage. This is known as a multivariate test. Understanding this helps in allocating sufficient traffic to each variant to achieve statistical significance.
• Search Space in Machine Learning: When performing hyperparameter tuning (for example, Grid Search), the FCP defines the total number of models that need to be trained. For example, tuning a random forest model with: $n\_estimators$: try 3 values, $max\_depth$: try 4 values, and $min\_samples\_split$: try 2 values. The total number of hyperparameter combinations to check is $3\times 4\times 2 = 24$. The data scientist knows they will have to train and evaluate 24 different models.

Summary: Fundamental Counting Principle

The Fundamental Counting Principle is a deceptively simple yet profoundly powerful tool. It moves from counting outfits to enabling the calculation of complex probabilities, guiding the design of robust experiments, profiling data quality, and managing the complexity of machine learning models. It is a fundamental piece of the quantitative reasoning toolkit.

More Examples

• If two dice are rolled, there are a total of 6 possible outcomes for the first die and 6 for the second die. The total number of different possible outcomes for rolling 2 dice will be $6\times 6 = 36$.
• If two cards are drawn from a deck without replacement, then there are 52 possible outcomes for the first card and 51 possible outcomes for the second card. The total number of outcomes for the experiment will be $52 \times 51 = 2652$.
• Florida uses three letters followed by 2 numbers followed by another letter for its license plate numbers. The total number of different license plate numbers possible is: $26^3 \times 10^2 \times 26 = 45,697,600$.

Probability in R Language