Comprehensive guide and practice questions for CBSE Class 11 Applied Mathematics curriculum (2026-27).
8.1 Fundamental Principles of Counting: Multiplication and Addition Rules
In Applied Mathematics, cybersecurity, operations research, and logistics design, combinatorial counting provides the mathematical rigor to quantify possibility spaces. The Fundamental Principle of Counting (FPC) allows analysts to count millions of combinations systematically without laborious listing.
Fundamental Counting Axioms & Logic
Fundamental Principle of Multiplication (The "AND" Rule):
If an event \(E_1\) can occur in \(m\) distinct ways, and following its occurrence, a second independent/dependent event \(E_2\) can occur in \(n\) distinct ways, then the combined sequence of events \(E_1\) AND \(E_2\) can occur in:
\[ \text{Total Ways} = m \times n \]
Generalized to \(k\) stages: \(n_1 \times n_2 \times n_3 \times \dots \times n_k\).
Fundamental Principle of Addition (The "OR" Rule):
If an event can occur in \(m\) distinct ways and another mutually exclusive alternative event can occur in \(n\) distinct ways (neither can occur simultaneously), then either the first OR the second event can occur in:
\[ \text{Total Ways} = m + n \]
Repetition vs Non-Repetition:
When forming \(r\)-length codes from \(n\) available distinct symbols:
\[ \text{With Repetition Allowed} = n^r \]
\[ \text{Without Repetition (Strictly Distinct)} = n(n - 1)(n - 2)\dots(n - r + 1) \]
The Leading Zero Rule:
In forming an \(r\)-digit positive integer, the most significant (leftmost) digit cannot be 0.
Systematic Box-Filling Method for Constrained Number Formation
Identify the Restrictive Positions First:
For Even numbers: The units place must be 0, 2, 4, 6, or 8.
For Odd numbers: The units place must be 1, 3, 5, 7, or 9.
For Numbers divisible by 5: The units place must be 0 or 5.
For Numbers greater than \(K\): The leading digit is restricted to digits \(\ge\) the leading digit of \(K\).
Handle the Zero Dilemma: If 0 is among the allowed digits and units digit requires 0, split the problem into mutually exclusive cases (e.g. Case 1: Units digit is 0; Case 2: Units digit is non-zero even).
Fill Remaining Slots: Fill remaining positions using the Multiplication Principle, accounting for repetition constraints.
Aggregate Cases: Sum the counts from mutually exclusive cases using the Addition Principle.
Comprehensive Worked Example: 4-Digit Number Formation with Restraints
Problem: How many 4-digit even numbers can be formed using the digits \(\{0, 1, 2, 3, 4, 5\}\) if:
Repetition of digits is allowed?
Repetition of digits is NOT allowed?
Solution:
A 4-digit number has four positions: [Thousands] [Hundreds] [Tens] [Units].
Case 1: Repetition is Allowed:
Thousands place: Can take any digit from \(\{1, 2, 3, 4, 5\}\) (0 is excluded). Total choices = 5.
Hundreds place: Can take any digit from \(\{0, 1, 2, 3, 4, 5\}\). Total choices = 6.
Tens place: Can take any digit from \(\{0, 1, 2, 3, 4, 5\}\). Total choices = 6.
Units place: Must be even: \(\{0, 2, 4\}\). Total choices = 3.
By the Multiplication Principle:
\[ \text{Total Numbers} = 5 \times 6 \times 6 \times 3 = 540 \text{ numbers.} \]
Case 2: Repetition is NOT Allowed:
Since 0 affects both the thousands place (cannot be 0) and the units place (makes it even), we split into two mutually exclusive sub-cases:
Sub-case 2A: Units digit is 0:
Units place = 1 choice (fixed as 0).
Thousands place = 5 choices (any from \(\{1, 2, 3, 4, 5\}\)).
Hundreds place = 4 choices (from remaining 4 non-zero digits).
Tens place = 3 choices (from remaining 3 non-zero digits).
Total for Sub-case 2A = \(5 \times 4 \times 3 \times 1 = 60\).
Sub-case 2B: Units digit is non-zero even (2 or 4):
Units place = 2 choices (either 2 or 4).
Thousands place = Cannot be 0, and cannot be the digit used in units place. Out of 6 digits, 2 are unavailable, leaving 4 choices.
Hundreds place = Out of 6 digits, 2 are used, leaving 4 choices (0 is now available).
Tens place = Out of 6 digits, 3 are used, leaving 3 choices.
Total for Sub-case 2B = \(4 \times 4 \times 3 \times 2 = 96\).
By the Addition Principle, total numbers without repetition:
\[ \text{Total} = 60 + 96 = 156 \text{ numbers.} \]
Progress Tracker & Self-Assessment Checklist
Track your computational speed and mastery of Fundamental Counting Principles.
Conceptual Milestones
Problem Solving Milestones
Practice Worksheet: Graded Exercises & Case Problems
Work through these graded problems from foundational mechanics to applied multi-stage scenarios.
Problem 1 (ATM PIN Code Space Analysis)
A banking system generates 4-digit numeric ATM PINs using digits \(0\) to \(9\). Find the total number of PINs possible if:
Any digit can be repeated freely.
All 4 digits must be distinct.
The PIN must start with a non-zero digit and all digits must be distinct.
View Step-by-Step Solution
Solution:
Note: Unlike standard multi-digit numbers, ATM PINs CAN begin with 0 unless explicitly forbidden.
(a) Free Repetition: Each of the 4 slots has 10 options:
\[ 10 \times 10 \times 10 \times 10 = 10^4 = 10{,}000 \text{ PINs.} \]
Problem 2 (Threshold Inequality: Numbers Greater than 5000)
How many numbers greater than 5000 can be formed using the digits \(\{2, 4, 5, 7, 8\}\) without repetition?
View Step-by-Step Solution
Solution:
Any valid number can either be a 4-digit number (starting with 5, 7, or 8) OR a 5-digit number (since all 5-digit numbers from these positive digits exceed 5000).
Given 5 flags of different colors, how many different signals can be generated if each signal requires the use of at least 2 flags, one below the other?