In the given figure, move three matchsticks so that the resulting figure contains two rectangles.

Manish and Manoj play 5 games of chess.
Both Manish and Manoj win the exact same number of games. There is no tie at all.

How?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

I am a word of 12 alphabets.

* Alphabets 12, 4, 7, 2, 5 : Eastern beast of burden
* Alphabets 1, 8, 10, 9 are street made famous by Sinclair Lewis.
* Alphabets 11, 3, 6 are past.

On whole it means a person suffering from delusions of greatness.

What Is it ?

What animal walks on four legs in the morning, two legs during the day, and three legs in the evening?

Oedipus, the king of Thebes, figured out the answer to the riddle:

You are confined in a room and given two metal rods. Out of these two rods, one is magnet and the other is the iron rod. They look starkly similar. You don't have any other metal object in the room.

How will you decide which one of those is magnet?

The answer I give is yes, but what I mean is no. What was the question?

Find the next number in the sequence

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

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

Can you replace the X (both small and big x) with the numbers between 1 to 19 such that all the rows of 3 numbers between X (big x) sum to 23?