Take number 1000 and then add 20 to it.
Now add 1000 one more time.
Now add 30.
Now add 1000 one more time.
Now add 40.
Now add 1000 one more time.
Now add 10.
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.
You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.
Can you find out how many chocolates are there in P and Q respectively?
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.