A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.

The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?

What can you hold in your right hand, but never in your left hand?

Can you find the dog hidden in a group of pandas?

Can you solve this picture maths equation?

A guard is positioned at the one side of the bridge saying ‘A’. His task is to shoot all those who try to leave from ‘A’ to the other side and say ‘B’. He also need to welcome the person who comes from another side ‘B’ to his side ‘A’. The guard comes out of his post every 1 hour and looks down the bridge for any people trying to leave. You are at side ‘A’ and wish to go to another side ‘B’. you also know that it would take 1:45 hr to cross the bridge. How will you cross the bridge?

The square root of number 121 is "11". What is the square root of the number "12345678987654321."?

A high school has a strange principal. On the first day, he has his students perform an odd opening day ceremony:

There are one thousand lockers and one thousand students in the school. The principal asks the first student to go to every locker and open it. Then he has the second student go to every second locker and close it. The third goes to every third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth student does this to every fourth locker, and so on. After the process is completed with the thousandth student, how many lockers are open?

Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

How can one talk without saying a single word?

In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?