Tell me the Hindi name of a Vegetable which if we remove 1st word will become a precious Stone and by removing the last word it will become a sweet eatable.
You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.
How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?
If we tie a Sheep to one peg, a circled grass is been eaten by the Sheep. If we tie the Sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the Sheep. If we want an eclipse then we put two pegs and then put a rope in between them and the other end of the rope is tied up on the Sheep's neck.
How should we tie the peg and the Sheep so that a square is eaten out from the garden grass? We only have one Sheep rope and the peg and the rings.
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki