John and Jacob are playing bets. John gives $10 to Jacob and Jacob deals four cards out of a normal 52-card deck which are chosen by him completely randomly. Jacob keeps them facing down takes the first card and shows it to John. John has a choice of either keeping it or looking at the second card. When the second card is shown to him, he again has the choice of keeping or looking at the third which is followed by the third card as well; only if he does not want the third card, he will have to keep the fourth card.
If the card that John is choosing is n, Jacob will give it to him. Then the cards will be shuffled and the game will be played repeatedly. Now you might think that it all depends on chance, but John has come up with a strategy that will help him turn the favor in his odds.
Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?
I look flat, but I am deep. Hidden realms I shelter. Lives I take, but the food I offer. At times I am beautiful. I can be calm, angry, and turbulent. I have no heart but offer pleasure as well as death. No man can own me, yet I encompass what all men must have. What am I?
You find yourself in a strange place guarded by two guards.One of the guard always say truth while other always lies.You don't know the identity of the two.You can ask only one question to go out from there. What should you ask?
A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.
For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.
Can you find out how much did the youngest one receive?
