Replace the question mark with the correct number.

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

In the addition below, all digits have been replaced by letters. Equal letters represent equal digits and different letters represent different digits.
ABCABA
BBDCAA
ABEABB
ABDBAA
------- +
AAFGBDH
What does the complete addition look like in digits?

John is a strange liar.

He lies on six days of the week, but on the seventh day, he always tells the truth.

He made the following statements on three successive days:

Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it"s Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."

On which day does John tell the truth?

10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?

Find the next number in the sequence

1, 2, 6, 21, 88, __?

John said, "If yesterday was tomorrow, today would be Friday."

When did John make this statement?

Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

Before reading ahead, you must know the fact that only one of the people here is telling the truth.

A says that B is lying.
B says that C is lying.
C says both A and B are lying.

Can you find out who is speaking the truth?

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?

A bag contains 64 balls of eight different colours. There are eight of each colour (including red). What is the least number you would have to pick, without looking, to be sure of selecting 3 red balls?