This is a fairly easy question on the concepts of divisibility. The specific concept to be used here is the Euclidean Division Algorithm. For more on the Euclidean Division Algorithm and remainders, you may go through my post on Remainders, the URL is pasted below:
https://gmatclub.com/forum/remainders-tips-and-hints-175000.html#p2424422When ‘a’ is divided by 3, the result is b and the remainder is 2. This means that that the dividend is a, the divisor is 3, the quotient (result is nothing but the quotient) is ‘b’ and the remainder is 2.
Similarly, when ‘b’ is divided by 3, the result is 2 and the remainder is 1. This means that that the dividend is b, the divisor is 3, the quotient is 2 and the remainder is 1.
When we use the above values in the Euclidean algorithm, we get two equations:
a = 3b + 2 and b = 3*2 + 1 = 7.
Substituting the value of b=7 in the first equation, we have a = 3*7 + 2 = 21 + 2 = 23.
The correct answer option is D.
Questions like these are the best for you to get a hang of basic divisibility concepts; solve a few of these and you will internalize the concepts well which will help you in applying these in the advanced questions.
Hope that helps!