JEE Challenger
More from Permutations and Combinations

Identify Correct Recurrence Relation for Binary Sequences

Comprehension Passage

Let ana_n denote the number of all nn-digit positive integers formed by the digits 0,10, 1 or both such that no consecutive digits in them are 00. Let bn=b_n = the number of such nn-digit integers ending with digit 11 and cn=c_n = the number of such nn-digit integers ending with digit 00.

Which of the following is correct?

Options

A

a17=a16+a15a_{17} = a_{16} + a_{15}

Correct
B

c17≠c16+c15c_{17} \neq c_{16} + c_{15}

C

b17≠b16+c16b_{17} \neq b_{16} + c_{16}

D

a17=c17+b16a_{17} = c_{17} + b_{16}

Step-by-Step Solution

To determine the correct relation, let us analyze the conditions given for the sequences:

An nn-digit positive integer formed by digits 00 and 11 must have its leading digit equal to 11 (since a positive integer cannot start with 00). It is also given that no two consecutive digits can be 00.

Let:

  • ana_n be the total number of such valid nn-digit integers.
  • bnb_n be the number of such valid nn-digit integers ending in 11.
  • cnc_n be the number of such valid nn-digit integers ending in 00.

Since every valid nn-digit integer must end in either 00 or 11, we have: a_n = b_n + c_n \quad \text{for all } n \ge 1 \tag{1}

Now, consider extending an (n−1)(n-1)-digit valid integer to an nn-digit valid integer:

  1. To obtain an nn-digit integer ending in 11, we can append 11 to any valid (n−1)(n-1)-digit integer, regardless of whether it ends in 00 or 11. Hence: b_n = a_{n-1} = b_{n-1} + c_{n-1} \quad \text{for all } n \ge 2 \tag{2}
  2. To obtain an nn-digit integer ending in 00, we can only append 00 to a valid (n−1)(n-1)-digit integer that ends in 11 (to avoid two consecutive zeros). Hence: c_n = b_{n-1} \quad \text{for all } n \ge 2 \tag{3}

Using equation (2) and equation (3), we can express cnc_n for n≥3n \ge 3 as: c_n = b_{n-1} = a_{n-2} \tag{4}

Substitute equations (2) and (4) into equation (1): an=bn+cn=an−1+an−2for all n≥3a_n = b_n + c_n = a_{n-1} + a_{n-2} \quad \text{for all } n \ge 3

Now let us evaluate each of the given options:

  • Option (A): a17=a16+a15a_{17} = a_{16} + a_{15} Since the recurrence an=an−1+an−2a_n = a_{n-1} + a_{n-2} holds for all n≥3n \ge 3, setting n=17n = 17 gives: a17=a16+a15a_{17} = a_{16} + a_{15} Therefore, this statement is correct.

  • Option (B): From cn=bn−1c_n = b_{n-1} and bn−1=bn−2+cn−2=cn−1+cn−2b_{n-1} = b_{n-2} + c_{n-2} = c_{n-1} + c_{n-2}, we have: cn=cn−1+cn−2  ⟹  c17=c16+c15c_n = c_{n-1} + c_{n-2} \implies c_{17} = c_{16} + c_{15} Thus, c17≠c16+c15c_{17} \neq c_{16} + c_{15} is incorrect.

  • Option (C): From equation (2), b17=b16+c16b_{17} = b_{16} + c_{16}, so b17≠b16+c16b_{17} \neq b_{16} + c_{16} is incorrect.

  • Option (D): We have a17=b17+c17a_{17} = b_{17} + c_{17}. Since b17=a16b_{17} = a_{16} and b16=a15b_{16} = a_{15}, and generally b17≠b16b_{17} \neq b_{16}, a17≠c17+b16a_{17} \neq c_{17} + b_{16}. Thus, this option is incorrect.

Hence, the correct option is A.