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?
Find a 9-digit number, which you will gradually round off starting with units, then tenth, hundred etc., until you get to the last numeral, which you do not round off. The rounding alternates (up, down, up ...). After rounding off 8 times, the final number is 500000000. The original number is commensurable by 6 and 7, all the numbers from 1 to 9 are used, and after rounding four times the sum of the not-rounded numerals equals 24.
See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.
Seven Robbers robbed a bank and hide the coins in a lonely place.
They decide to divide the money equally the next morning. Two greedy robbers decided to cheat the others and reach the place at night. They equally divided the coins between them, one coin left. So they called another robber and then they decided to divide equally among the three. Sadly again one coin left. The same thing happened to the 4th 5th and the 6th robber.
However, when the 7th robber reached in the morning, they can divide the coins equally.
