You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
A four-digit number (not beginning with 0) can be represented by ABCD. There is one number such that ABCD=A^B*C^D, where A^B means A raised to the B power. Can you find it?
You are a cab driver who pools passengers. You pick 3 people from a destination and drop 1 after an hour. 2 people climb aboard at the same time and you drop 3 at the next destination. After some time, you pick 2 passengers only to drop 1 after a short distance where 3 more passengers climb up the cab. You leave the rest of the passengers one by one to their destination and then come back home.