1 dollar = 100 cent
= 10 cent x 10 cent
= 1/10 dollar x 1/10 dollar
= 1/100 dollar
= 1 cent

=> 1 dollar = 1 cent

solve this tricky problem?

If,
29 - 1 = 30
9 - 1 = 10
14 - 1 = 15

Based on similar logic, Can you prove that the below algebraic equation is true?
11 - 1 = 10 ?

Three friends named Mr. Black, Mr. Yellow and Mr. Green enter a pub on a weekend night. They are wearing either a Black, Yellow or Green shirt.

Mr. Yellow says to them, 'Did you notice that we all are wearing different color shirts than our names?'

To this, the man who was wearing the Green shirt said. 'Wow, thats right.'

Can you identify who is wearing which colour shirt ?

I have a mouth but I don't eat.
I have a bank but have no money.
I have a bed but i dont sleep.
I wave but have no hands.

Who Am I ?

Can you discover the missing number in this series?

37, 10, 82
29, 11, 47
96, 15, 87
42, ?, 15

Find the smallest sentence with all the English alphabet.

What came first, the chicken or the egg?

I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.

What number I am thinking of?

I purchased an awesome ice cream cone having 5 different flavour scoops.
Five flavours are pistachio, mint-chip, strawberry, marshmallow, and raspberry

I will give u some clues so that you can figure out the order of flavours from bottom to top.
1. The bottom flavour of the cone has 10 letters.
2. The marshmallow scoop is between the pistachio and the mint-chip scoop.
3. marshmallow is the raspberry scoop but below the mint-chip scoop.

So can you figure out the flavour of ice cream in order from bottom to top?

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?