If we add four times the age of John four years from now to five times his age five years from now we get ten times his current age.

How old will John be two years from now?

I have an eye but still cannot see.

Who am I?

Paul's height is six feet, he's an assistant at a butcher's shop and wears size 9 shoes. What does he weigh?

In a secret society, a buried chamber can be accessed only via a secret password. The password is seven characters long and comprises of just letters and numbers.

You find a code that can help you in cracking the password. The code says "You force heaven to be empty".

Can you deduce the password from that?

How is the moon similar to a dollar?

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

A person is found murdered in his Chamber. When the crime scene is investigated, the Investigator find out that there is a calendar on which the victim has written a few numbers with his blood. The numbers are 4, 11, 11 and 4.

There are four suspects in the murder, John, Jacob, Anna and Lee. Can you find out who is the murderer?

In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$

John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.

John has only 10000$. How many wine bottles of each type, John must buy?

Replace the question mark with the correct number in below Picture:

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?