# CAT 2000 | Question: 98

505 views

There is a vertical stack of books marked $1, 2,$ and $3$ on Table-A, with $1$ at the bottom and $3$ on top. These are to be placed vertically on Table-B with $1$ at the bottom and $2$ on the top, by making a series of moves from one table to the other. During a move, the topmost book, or the topmost two books, or all the three, can be moved from one of the tables to the other. If there are any books on the other table, the stack being transferred should be placed on top of the existing books, without changing the order of books in the stack that is being moved in that move. If there are no books on the other table, the stack is simply placed on the other table without disturbing the order of books in it. What is the minimum number of moves in which the above task can be accomplished?

1. One
2. Two
3. Three
4. Four

## Related questions

1 votes
4 answers
1
2,181 views
Convert the number $1982$ from base $10$ to base $12.$ The result is$1182$$1912$$1192$$1292 0 votes 1 answer 2 652 views Let \text{N} = 55^3 + 17^3 – 72^3.\; \text{N} is divisible byboth 7 and 13both 3 and 13both 17 and 7both 3 and 17 3 votes 1 answer 3 21,958 views Sam has forgotten his friend’s seven-digit telephone number. He remembers the following: the first three digits are either 635 or 674, the number is odd, and the nu... 0 votes 0 answers 4 383 views The integers 34041 and 32506 when divided by a three-digit integer n\text{’} leave the same remainder. What is n\text{’}?$$289$$367$$453$$307 2 votes 1 answer 5 718 views Let \text{N} = 1421 \times 1423 \times 1425. What is the remainder when \text{N} is divided by 12?$$0$$9$$3$$6$