Unit 3: Combinations and Counting Principles
Important Questions
1. Basics of Counting:
○ Explain the basic rules of counting: addition and multiplication principles with
examples.
○ How does the principle of multiplication work in multi-stage experiments?
Illustrate with an example.
2. Pigeonhole Principle:
○ State and prove the Pigeonhole Principle.
○ Explain the generalized Pigeonhole Principle with examples.
○ If 10 people are seated in 9 chairs, prove that at least one chair must be shared
by more than one person.
3. Permutations and Combinations:
○ Derive the formula for permutations of nnn distinct objects taken rrr at a time.
○ Derive the formula for combinations of nnn distinct objects taken rrr at a time.
○ What are circular permutations? How do they differ from linear permutations?
4. Principle of Inclusion and Exclusion:
○ State and prove the principle of inclusion and exclusion for two sets.
○ Use the principle of inclusion and exclusion to find the number of integers
between 1 and 100 that are divisible by 2, 3, or 5.
○ Solve problems involving overlapping sets using inclusion and exclusion.
PYQs
1. Prove the Pigeonhole Principle with an example. (Repeated in multiple years)
2. Find the number of arrangements of the letters in the word "BANANA." (Frequently
asked)
3. How many ways can 5 men and 3 women sit in a row if no two women are adjacent?
(Common in PYQs)
4. Solve: A box contains 5 red, 4 blue, and 6 green balls. How many ways can 3 balls be
drawn so that at least one is red?
Recursion and Recurrence Relations
Important Questions
1. Linear Recurrence Relation with Constant Coefficients:
○ Define recurrence relations with examples. How are they different from recursive
functions?
○ Solve the recurrence relation an=3an−1−2an−2a_n = 3a_{n-1} -
2a_{n-2}an=3an−1−2an−2, where a0=2a_0 = 2a0=2 and a1=5a_1 = 5a1=5.
○ Write the general solution for a linear recurrence relation with constant
coefficients.
2. Homogeneous Solutions:
○ Solve the homogeneous recurrence relation an−5an−1+6an−2=0a_n - 5a_{n-1} +
6a_{n-2} = 0an−5an−1+6an−2=0.
○ Derive the characteristic equation of a homogeneous recurrence relation and
explain its significance.
3. Particular Solutions:
○ Solve the recurrence relation an−4an−1=2na_n - 4a_{n-1} = 2^nan−4an−1=2n.
○ How do you find a particular solution of a non-homogeneous recurrence relation?
Provide an example.
4. Generating Functions:
○ What is a generating function? Write the generating function for the sequence
1,2,3,4,…1, 2, 3, 4, \dots1,2,3,4,….
○ Use generating functions to solve the recurrence relation an=2an−1+n2a_n =
2a_{n-1} + n^2an=2an−1+n2, where a0=1a_0 = 1a0=1.
○ Solve the Fibonacci sequence using generating functions.
5. Total Solutions:
○ How do you find the total solution of a recurrence relation? Explain with an
example.
○ Solve an−3an−1+2an−2=n+1a_n - 3a_{n-1} + 2a_{n-2} = n +
1an−3an−1+2an−2=n+1, where a0=0a_0 = 0a0=0 and a1=1a_1 = 1a1=1.
PYQs
1. Solve the recurrence relation an=2an−1+3an−2a_n = 2a_{n-1} +
3a_{n-2}an=2an−1+3an−2, given a0=1a_0 = 1a0=1 and a1=2a_1 = 2a1=2. (Repeated)
2. Find the general solution of an−4an−1+4an−2=0a_n - 4a_{n-1} + 4a_{n-2} =
0an−4an−1+4an−2=0. (Common)
3. Derive the generating function for the sequence 1,1,2,3,5,8,…1, 1, 2, 3, 5, 8,
\dots1,1,2,3,5,8,…. (Frequently asked for Fibonacci)
4. Use the principle of inclusion-exclusion to count the number of solutions of a recurrence
relation where constraints are involved.
Preparation Tips:
1. Concept Clarity:
○ Understand the formulas for permutations, combinations, and recurrence
relations thoroughly.
○ Focus on proofs, as they are often asked to test conceptual understanding.
2. Practice Problems:
○ Solve PYQs to identify patterns in frequently asked questions.
○ Practice a mix of conceptual and numerical problems for better preparation.
3. Formulas to Remember:
○ P(n,r)=n!(n−r)!P(n, r) = \frac{n!}{(n-r)!}P(n,r)=(n−r)!n!
○ C(n,r)=n!r!(n−r)!C(n, r) = \frac{n!}{r!(n-r)!}C(n,r)=r!(n−r)!n!
○ Generating function: G(x)=∑n=0∞anxnG(x) = \sum_{n=0}^{\infty}
a_nx^nG(x)=∑n=0∞anxn
4. Previous Year Trends:
○ Questions involving practical applications of counting principles and solving
recurrence relations using characteristic equations are commonly asked.
