There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
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.
