Let A = {1, 2, 3, ..., 100} and R be a relation on A such that R = {(a, b) : a = 2b + 1}. Let 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]
(2)
Let the smallest value is in A = {1, 2, 3, ..., 100}.
Since,
The sequence is {(63, 31), (31, 15), (15, 7), (7, 3), (3, 1)}
k = 5