You have to fill the below given grid in a manner that every row and column contains the digits 1 to 6. Also, make sure that the squares that are connected with each other must contains the same digit.

Solve the equation by replacing the alphabet with numbers.

MOM + MOM + NO = BOOK=

Two trains start at the same time, one from Bangalore to Mysore and the other from Mysore to Bangalore. if they arrive at their destinations one hour and four hours respectively after passing one another, how much faster is one train running than the other?

Why do Chinese men eat more rice than Japanese men do ?

If 2 workers can complete painting 2 walls in exactly 2 hours.

How many workers would be needed to paint 18 walls in 6 hours?

John bought 150 chocolates but he misplaced some of them. His Father asked him how many chocolates were misplaced.
He gave the following answer to him:
If you count in pairs, one remains
If you count in threes, two remain
If you count in fours, three remain
If you count in fives, four remain
If you count in sixes, five remain
If you count in sevens, no chocolate remains.

Can you analyze the statements and tell us how many chocolates were lost?

Many have heard it, but nobody has ever seen it, and it will not speak back until spoken to. What is it?

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

A Scientist was fifty years old in the year 2000 but he was forty years old in the year 2010. How can this be possible?

PS: It has a logical answer.

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?