A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.
In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.
Can you calculate the score for each of the five throws?
Rahul decided to meet Simran so he boards a local train from Bombay station. Just after the station, there is a 1km long tunnel. The train starts and is now accelerating. Rahul is a claustrophobic guy, so what is the best position for him to sit?
The below given figure comprises of a pattern through which you can determine the missing letter. Can you push your mind to find the pattern and add the missing letter?
1. Gianni was either in Italy or France in 1997.
2. If Gianni did not kill Versace, Hilton must have killed him.
3. If Versace died of suffocation, then either Gianni killed him or Versace committed suicide.
4. If Gianni was in Italy in 1997, then Gianni did not kill Versace.
5. Versace died of suffocation, but he did not kill himself.
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?
15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.
How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?
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 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