A charming young lady was approached by a kind looking old woman in a restaurant. The old woman said to her, 'You look exactly like my younger daughter. Sadly she passed away a couple of months back. Could you do me a favor and say 'Goodbye, mother' with a kind smile on your face when I leave?

The young lady agreed for the same and said, 'Goodbye, mother' when the old woman left. Soon after, she got the most disengaging shock of her life.

Can you guess what the shock was?

An inspection by the superintendent of St. Joseph School was scheduled on the next day. The class teacher Jenifer knew that he would be asking questions from her class and she would have to choose a pupil to answer. To offer a perfect impression over him, the teacher explained certain instructions to the students to maximise the chances of getting correct answer every time.

What did she say to the students?

There are a hundred statements.

First person says: At least one of the statements is false.

Second person says: At least two of the statements is false.

Third person says: At least three of the statements are false.

Fourth person says: At least four of the statements are false.

..

..

..

Hundredth person says: At least a hundred of the statements are false.

Analysing it, how many statements do you think are false and how many are true?

In this image, you can see three almost identical Doraemon images. Can you spot the odd one out from them?

How can you write nineteen in a manner that if we take out one, it becomes twenty?

Can you solve this tricky maths equation problem by replacing it? mark with the correct symbol?

19834 -----: 187
15921 -----: 153
17561 -----: 139
13734 -----: ???

I am a five-letter word and people eat me. If you remove the first letter I become an energy form. If you remove the first two letters, I am needed to live. Scramble the last three letters and I am a drink. What word am I?

In the given picture, in how many ways can you read the word "Tiger"?

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?

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).

How will you do it?