I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
While handling a project, the landscaper is asked by the owner of the mansion that he wants four trees in front of his mansion that are exactly equidistant from each other.
In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?
I can sizzle like bacon,
I am made with an egg,
I have plenty of backbone, but lack a good leg,
I peel layers like onions, but still remain whole,
I can be long, like a flagpole, yet fit in a hole.
If you were to put a coin into an empty bottle and then insert a cork into the neck, how could you remove the coin without taking out the cork or breaking the bottle?
