Remove two matchsticks to make the below equation correct.

What number divided by 4 is the same as that number minus 4?

Below rebus represent famous DiCaprio movie. Can you name it?

Which three-digit number, made of consecutive digits, like 567, is 2 less than a cube and 2 more than a square?

I add 5 to 9 and get 2. The answer is correct, so what am I?

It walks on 4 when its young, walks on 2 when it's older, and walks on 3 when its very old?

Usually, a boxing match consists of twelve rounds. In a particular friendly match between two heavyweights, the match was finished in the ninth round itself as one of the boxers knocked out the other one.

But, in that fight, no man threw even a single punch.

How can this be possible?

In a science lab, a petri dish hosts a healthy colony of yeast for an experiment. Now every minute, all the yeast cells divide into two. At noon, there was just a single cell of yeast and at 1:22, the Petri dish was half full. Can you calculate when the dish will be full of yeast?

There are three identical triplets sisters. Demi is the oldest of them all and she always speaks the truth. Diana is the next one who is a liar always. Drew, the youngest of them all speaks both truth and lies randomly.

On a rainy day, a family friend Victor visited them. Since there were starkly identical, he was not able to recognize them. Thus to clarify, he asked one question to each one of them.

He started with the one standing on the left and asked, 'Which sister is in the middle of you three?' She answered, 'That's Demi.'

Then, he asked the one standing in the middle, 'What is your name?' She answered, 'I am Drew.'

Finally, he asked the one standing on the right, 'Who is standing in the middle?' She answered, 'She is Diana.'

Victor was left baffled. He asked the questions three times and received different answers every time.

Can you tell who was who?

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?