Some Basic Principles and Techniques
1. Introduction to Counting Techniques
Counting is the process of determining the number of possible outcomes
without listing them individually.
This chapter forms the foundation of combinatorics and is essential
for solving problems in:
- Permutations and Combinations
- Probability
- Binomial Theorem
2. Fundamental Principle of Counting
If an operation can be performed in m ways and another independent
operation can be performed in n ways, then the total number of ways
to perform both operations is m × n.
Total number of outcomes = $m \times n$
This principle is also called the Multiplication Rule.
3. Extension of Fundamental Principle
If there are k independent tasks which can be performed in
$n_1, n_2, n_3, \dots, n_k$ ways respectively, then:
Total number of ways = $n_1 \times n_2 \times n_3 \times \dots \times n_k$
4. Addition Principle (Sum Rule)
If a task can be done in m ways or another task can be done in n
ways, and both tasks cannot occur together, then the total number of ways is:
$m + n$
Use addition rule when choices are mutually exclusive.
5. Difference Between Addition and Multiplication Rules
| Situation | Rule Used |
|---|---|
| Choose one of many options | Addition Rule |
| Perform tasks in sequence | Multiplication Rule |
6. Factorial Notation
$n! = n \times (n-1) \times (n-2) \times \dots \times 1$
- $0! = 1$
- $1! = 1$
Factorial notation is heavily used in permutations and combinations.
7. Counting Arrangements Using Factorials
Number of arrangements of n distinct objects taken all at a time is:
$n!$
8. Counting with Restrictions
When restrictions are involved, use:
- Total ways − Restricted ways
- Fix the restricted element first
9. Counting Digits, Numbers, and Codes
Common exam problems include:
- Forming numbers with digits
- Passwords and codes
- Binary strings
If each position has $n$ choices and there are $r$ positions, total outcomes = $n^r$
10. Counting Without Repetition
If repetition is not allowed, reduce the number of choices at each step.
$n \times (n-1) \times (n-2) \times \dots$
11. Counting With Repetition Allowed
Number of outcomes = $n^r$
This is frequently tested in number formation and coding problems.
12. Use of Complementary Counting
Sometimes it is easier to count:
Total outcomes − Undesired outcomes
13. Ordering vs Selection
This chapter prepares the base for:
- Permutation → order matters
- Combination → order does not matter
14. Common Mistakes by Students
- Using multiplication instead of addition
- Forgetting restrictions
- Incorrect use of factorials
- Overcounting outcomes
15. Typical JEE Question Patterns
| Type of Question | Main Principle Used |
|---|---|
| Forming numbers | Multiplication rule |
| Choosing options | Addition rule |
| Codes and passwords | $n^r$ rule |
16. Final Revision Checklist
You have mastered this topic if you can:
- Apply addition and multiplication rules correctly
- Use factorial notation fluently
- Handle restrictions logically
- Identify whether repetition is allowed
- Prepare for permutations and combinations confidently