Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.
You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
As shown in the picture below, we can see a boy hanging on the tree branch to save his life. There are various ways in which he can die like1. A snake hanging toward the right waiting to bite the boy.2. A roaring Lion near the tree.3. Two crocodiles are ready to attack if the boy reaches near water. The tree is chopped to some extent, so can fall as if he moves a lot. Can you give this boy an escape plan?
Two natural numbers have a sum of less than 100 and are greater than one.
John knows the product of the numbers and Jacob knows the sum of numbers.
The following conversation takes place between them:
John: 'I am not aware of those numbers.'
Jacob: 'I knew you wouldn't be. I am not aware myself.'
John: 'Now I know them!'
Jacob: 'Now I know them, too!'
Two boys wish to cross a river. The only way to get to the other side is by boat, but that boat can only take one boy at a time. The boat cannot return on its own, there are no ropes or similar tricks, yet both boys manage to cross using the boat.
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.
Christina, Allison and Lena are 3 daughters of John a well-known Mathematician, When I asked John the age of their daughters. He replied "The current age of her daughters is prime. Also, the difference between their ages is also prime."
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.