You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'
How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?
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.
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.
Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.
Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?
