In the Thar desert, 3 men found a big 24L Jar is full of water. Since there is a shortage of water so they decided to distribute the water among themselves such that they all have equal amounts of it. But they only have a 13L, a 5L and an 11-litre Jar.
A Miser man decided to go on a vacation for a month. He goes to the bank and asks for a trip loan of $500. The bank officer asks the man that the loan can only be approved when he mortgage some valuable thing at the bank. Miser man mortgages his only car whose worth was a whopping $80000. The Bank officer laughed at him and approve the loan instantly. After vacation when the miser man returns, the bank officer asked him "Are you an idiot, why is your mortgage such an expensive car for such a short loan?".
Miser man replied with some reason and the bank officer agreed that the miser man is actually not an idiot.
What did miser man reply to the bank loan officer?.
The sum of a mother, her baby and her dog's weight is 170 Kg. How much does the baby weigh if the mother weighs 100 kg more than the combined weight of the baby and the dog, and the dog weighs 60 per cent less than the baby?
A fresh card pile is taken out of a box (the pile has 54 cards including 2 jokers). One joker is taken out and then the cards are shuffled for a good amount of times. After shuffling, two piles are made by dividing that one pile.
What is the possibility that one of the piles will have a card sequence from A to K in order?
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?