Consider all the numbers between 1 and 1 million. Among all these numbers, there is something very special about the number 8 and the number 2202. What is it?

Can you move 2 matchsticks to form four equal sized squares.

What has 88 keys?

Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

There are four people in a house. A fireman, an athlete, an old woman, and a drunk guy. The house catches fire and before the fact is known, it is too late. All they know is that the entire house is in flames and it will collapse exactly after twelve minutes. Now they can move out of the house but for that, they will have to pass the hallway which is entirely blazing with flames. Thus to move, one must carry a fire extinguisher to keep the flames away. Seeking the burnt wooden floor, only two people can run through that hallway at one time. But for others to go, one must return back with the fire extinguisher. The fireman is trained for such tasks and can run through the hallway in a minute. The athlete can make it in a couple of minutes. The old woman can run slowly and will cover the hallway in four minutes. The drunk guy will take five minutes to run through it. If all of them can make it through the hallway in twelve minutes, all of them will be saved. When two move together, they will run at the speed of the slower ones.

How will all four of them manage to run to safety?

Can you find out the total number of triangles in the given figure?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

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?

You see a mathematical expression in the picture. Can you think of a movie that this expression refers to?

I cry without having a voice.
I fly without having wings.
I bite without having teeth.
I whisper without a mouth.

Who am I?