You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.

What is the end of everything?

What can go through glass without breaking it?

If Japan and Panama decided to merge into a single country, probably people will name it Japanama.

Can you think of two more such country's unions that could produce similar names like Japanama by overlapping their three letters?

What time is it when an elephant sits on a fence?

The Federal bank of London is abducted by the robbers. The head of the robbers asked the cashier to empty their money vault to them and when suddenly cashier got a call from her father. To avoid any suspicion, the robber asked the cashier to pick the call and reply her father in the shortest manner possible.

The cashier told her father "Is there an emergency father, Call me when you are free and I will help you in your furnishing" and then the cashier hung up the phone.

After 10 minutes, police arrived at the crime scene.

How did the police know about the robbery?

0 0 0 = 6
1 1 1 = 6
2 2 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

You can use any mathematical symbols in the space provided to make all above algebraic expressions true.

Can you find out who is the kidnapper in below Picture and why, Explain ?

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 count the number of quadrilaterals in the picture below?