Q.

Let A = {1, 2, 3, ..., 100} and R be a relation on A such that R = {(a, b) : a = 2b + 1}. Let (a1,a2),(a2,a3),(a3,a4),...,(ak,ak+1) be a sequence of k elements of R such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k, for which such a sequence exists, is equal to :          [2025]

1 8  
2 5  
3 6  
4 7  

Ans.

(2)

Let the smallest value is ak+1 in A = {1, 2, 3, ..., 100}.

Since, ak=2ak+1+1=(2×1)+1=3

       ak1=2ak+1=(2×3)+1=7

           ak2=2ak1+1=(2×7)+1=15

          ak3=2ak2+1=(2×15)+1=31

          ak4=2ak3+1=(2×31)+1=63

          ak5=2ak4+1=(2×63)+1=127A

   The sequence is {(63, 31), (31, 15), (15, 7), (7, 3), (3, 1)}

   k = 5