A hen, a dog, and a cat are stolen. Three suspects are arrested named Robin, Steve, and Tim. The police are sure that all of them stole one of the animals but they don't know who stole which animal.

Sherlock Holmes is appointed to identify and is provided with the following statements from the investigation.

Robin - Tim stole the hen
Steve - Tim stole the dog
Tim - Both Robin and Steve are lying. I neither stole a hen nor a dog.

Sherlock is somehow able to deduce that the man who stole the cat is telling a lie and the man who stole the hen is telling truth.

Can you help him find out who stole which animal?

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.

Using mathematical symbols like +, -, and x in order to make the equations correct. Replace # with the above-given symbols.

9 # 8 # 7 # 6 # 5 # 4 = 91

John can place six large boxes or nine small boxes into a carton.

Can you find out in how many cartons can he place sixty-six boxes in total?

John asked Jack, "The time right now is 7 pm. Can you tell me what will be the time 23, 999, 995 hours later ?"

While Bella does not know the answer, do you ?

Do You See It?

In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.

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?

'Ferrari driver' easily beats the 'force driver' in a two-car race. How did Indian newspapers truthfully report so to look as a 'force drive' had outdone the 'Ferrari driver'? Think!!!

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?