Aishwarya Rai walks into a bank to cash out her check.
By mistake the bank teller gives her dollar amount in change, and her cent amount in dollars.
On the way home she spends 5 cent, and then suddenly she notices that she has twice the amount of her check.
Michelangelo is being chased by a couple of cannibals who will kill him as soon as they get a hold of him. The only way to get rid of them is crossing the river bridge made of ropes and cut it on reaching the other end. He have found two diamonds in the woods each weighing 8 lbs. The rope is weak and can only accommodate a weight of 150 lbs. He weighs 140 lbs. Still he manages to cross the bridge and get rid of the cannibals with the diamonds without taking off any kind of clothing.
There are 100 doors. 100 strangers have been gathered in the adjacent room. The first one goes and opens every door. The second one goes and shuts down all the even numbered doors – second, fourth, sixth... and so on. The third one goes and reverses the current position of every third door (third, sixth, ninth… and so on.) i.e. if the door is open, he shuts it and if the door is shut, he switches opens it. All the 100 strangers progresses in the similar fashion.
After the last person has done what he wanted, which doors will be left open and which ones will be shut at the end?
Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.
Imagine that you are travelling to a village. You happen to reach a point in the road where there is a fork. There are two ways that you can go into but only one amongst them is correct and leads to the village. You happen to see two men standing on the fork and you can ask them for the direction. To your bad luck, one amongst the two men always lies and the other one always says the truth. But you do not know who is a liar and who is not. At that point of the situation you are allowed to ask only one question to any one of the men standing there.
You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village
A terrorist hijacks a plane with 10 passengers and there is lots of gold in the plane.
After talking the gold , he asked the government officials for 11 parachutes.
He killed all the passenger so that no one can identify him , take one parachute and jumps off.
Was he stupid to ask for 11
parachutes if he need only one ?
For my anniversary, I decided to surprise my wife. Since she is a voracious reader, I decided to collect a lot of books for her. On the first day of the month, I bought one book, on the second, I bought two and on the third, I bought three. This process went on till the anniversary and on the day, I had 276 books with me to gift her.
Can you calculate, on which day is our anniversary?