Accidentally, two trains are running in the opposite direction and enter a tunnel that is 200 miles long. A supersonic bird that has fled the lab and taken shelter in the tunnel starts flying from one train towards the other at a speed of 1000 mph. As soon as it reaches the second train, he starts flying back to avoid collision and meets the first train again at the other end. The bird keeps flying to and fro till the trains collide with each other.
What is the total distance that the supersonic bird has traveled till the trains collided?
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.
A wealthy man lives alone in a small cottage. Being partially handicapped he had everything delivered to his cottage. The mailman was delivering a letter one Thursday when he noticed that the front door was ajar. Through the opening he could see the man's body lying in a pool of dried blood. When a police officer arrived he surveyed the scene. On the porch were two bottles of warm milk, Monday's newspaper, a catalog, flyers, and unopened mail. The police officer suspects it was foul play. Who does he suspect and why?
A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?