IAE Academy

ISRO CS 2025 Q.60: solution and answer

ISRO 2025 · CSQ.60 · 1 mark · MCQ

How many subsets of {1, 2, 3, 4…12} can be formed such that no two elements in the subset are consecutive?

  1. (A)

    144

  2. (B)

    377

  3. (C)

    610

  4. (D)

    89

See the question in the paper

Answer and solution

ANSWER

The number of such subsets is , option (B).

Official answer: BSource: ISRO's final answer key of 15 May 2026

  1. Let be the number of subsets of with no two consecutive elements. The empty set counts as a valid subset.

  2. Split on the element . If is not chosen, the subset is any valid subset of , giving ways.

  3. If is chosen, then must be left out. The rest is any valid subset of , giving ways.

  4. Every valid subset falls in exactly one of these two cases, so for . This is the Fibonacci recurrence.

  5. Base cases: (only the empty set) and (the empty set and ).

  6. Compute: .

  7. Hence with , and . The other options are Fibonacci numbers at the wrong index: , and .

KEY IDEA

Condition on whether the largest element is chosen. This gives , so the count of subsets of with no two consecutive elements is the Fibonacci number .

WATCH OUT FOR

Starting the recurrence from the wrong base case, or leaving out the empty set. That shifts the answer to a neighbouring Fibonacci number such as , , or .

From the ISRO CS 2025 paper. Every question of this paper · The full paper (PDF, ISRO) · All 5 ISRO Counting & axioms questions, with notes

More ISRO Counting & axioms questions