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?

John drives to his office at 20km/hr. After reaching the office, he realizes that today is a holiday. He went back at an average speed of 30km/hr. Discounting the time spent in the stoppage what was the average speed of his journey?

Given below is simple addition with a defined pattern pattern:
7 + 7 = 2
8 + 8 = 4
8 + 5 = 1
6 + 9 = 3
10 + 11 = 9

Can you analyze the pattern and find out the answer for:

4 + 9 = ?

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

Replace the question mark with the correct number.

2 + 2= 4
3 + 3= 18
4 + 4= 48
5 + 5= ?

There once were seven dwarfs who were all brothers. They were all born two years apart. The youngest dwarf is seven years old. How old is his oldest brother?

Can you find the key in the picture below?

My first is in chocolate but not in ham. My second is in cake and also in jam. My third at tea time is easily found. Altogether, this is a friend who is often around. What is it?

Today, I celebrated my 32nd birthday but I was born in 1972.
How is this possible?

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.