StemCET Logo

Maths Question 21 – JEE-MAIN 2025

For n≥2, let Sn denote the set of all subsets of {1,2,...,n} with no two consecutive numbers. For example {1,3,5}∈S6, but {1,2,4}∉S6. Then n(S5) is equal to _______.

Consider how the presence or absence of the largest number n affects the valid subsets of {1,2,...,n} with no consecutive numbers.

Step 1: Define the Recurrence Relation✦ Active

Let an be the number of subsets of {1,2,...,n} with no two consecutive numbers. We can derive a recurrence relation by considering two cases for a subset S∈Sn:

Case 1: n∉S. If n is not in the subset, then S must be a valid subset of {1,2,...,n−1}. There are an−1 such subsets.

Case 2: n∈S. If n is in the subset, then n−1 cannot be in the subset (to avoid consecutive numbers). Thus, the remaining elements of S must form a valid subset of {1,2,...,n−2}. There are an−2 such subsets.

an=an−1+an−2
💡 Teacher's Secret Hint

This recurrence relation is characteristic of the Fibonacci sequence.

Step 2: Calculate Base Cases○ Expand

For n=1, the set is {1}. The valid subsets are ∅ and {1}. So, a1=2.

For n=2, the set is {1,2}. The valid subsets are ∅, {1}, and {2}. The subset {1,2} is not allowed as it contains consecutive numbers. So, a2=3.

💡 Teacher's Secret Hint

Remember to include the empty set as a valid subset.

Step 3: Compute n(S5)○ Expand

Using the recurrence relation an=an−1+an−2 with the base cases a1=2 and a2=3:

a3=a2+a1=3+2=5
a4=a3+a2=5+3=8
a5=a4+a3=8+5=13

Thus, n(S5)=13.

✦ STEM Console utilizes AI models to generate step-by-step explanations and math clues. AI can make mistakes.