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.
John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.
Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.
If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?
A man hijacks an aeroplane transporting both passengers(8 of them) and valuable cargo. After taking the cargo, the man demands nine parachutes, puts one of them on, and jumps, leaving the other eight behind. Why did he want eight?
There is so small cabin inside a deep forest.
All the forest burned out to worst possible but the inside of the cabin is still the same.
However all the person inside the cabin die.
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
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.