You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

John bought a new car. He has a habit of eating ice cream from a particular ice cream shop while returning home from office. Whenever, he eats strawberry ice cream, he faces no problem. But whenever, he eats chocolate ice cream, the car starts giving problem. At first, he thinks, it is just a co-incidence but when this awkward incident happens for 3-4 times, he reports this problem to the company.

The mechanic of the company checks but finds no problem at all. The next day, when he stops by to eat chocolate ice cream, the car again starts giving problem.

Can you find the possible reason?

What number comes next in the series?

5 15 5 18 5 24 14 20 _

If all the below statements are true

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.

Who killed Versace and where was Gianni in 1997?

Can you find a pattern and the missing number in the series given below?

100, 155, 258,? , 584, 819.

A spaceship was lost. The detective was given a piece of paper. This was the location of the spaceship! This is what the slip had scribbled on it:
Juice, Umbrella, Potato, Ice, Tomato, Elephant, Rice.

Where is the spaceship?

A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?

Why did Buffon take the goal with him after every Juventus match?

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?

You find yourself in a strange place guarded by two guards.One of the guard always say truth while other always lies.You don't know the identity of the two.You can ask only one question to go out from there. What should you ask?