Replace each alphabet with the number (1-9) to make the below equation correct.

AB * C = DE - F = GH / I

When I asked a girl's name she told me her name is the date '07/09/2001'.

I thought for a few seconds and then I got her name. Do you?

He loves to dance, twist and prance, he shakes his tail, and as a way he sails, wingless he flies into the sky. What is he?

what does the below rebus mean?

John can eat 27 chocolates in an hour, Jacob can eat 2 chocolates in 10 minutes, and Jolly can eat 7 chocolates in 20 minutes. How long will it take them to share and eat a box of 120 chocolates whilst playing Chess?

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

The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Fate has decided that you will only be pleased to meet me when you need me

Maybe that is why, when I am working, I start working

However annoying I may be to the regulars, the little ones are always inspired

I will always be waiting if you try to reach me

How many of you can guess my name, let me see

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?

See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.