You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.
What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?
The husband and wife were jogging in the morning. To match every two steps of the husband, the wife required three steps. If Both of them start with the here right foot. After how many steps do their left foot be together?
There were three women in all the swimming costumes!
One was happy and the other two were sad!
The happy one was crying and the sad ones were smiling.
Why was this?
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
Six people park their car in an underground parking of a store. The store has six floors in all. Each one of them goes to a different floor. Simon stays in the lift for the longest. Sia gets out before Peter but after Tracy. The first one to get out is Harold. Debra leaves after Tracy who gets out on the third floor.
Can you find out who leaves the lift on which floor?
John, a 5-year-old boy, was really fond of the chocolates. He asked his Mother to give him some money to buy his favourite chocolates. His Mother gave him $45. He went to the shopkeeper and asked, "How much is one chocolate for?". The shopkeeper said $3 for one chocolate. Also, if you give me the wrappers of three chocolates, I will give you one for the exchange.
In total, how much chocolate could John eat?
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.