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 ?

Below rebus represent famous DiCaprio movie. Can you name it?

People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?

What goes through cities and fields, but never moves?

When we see 2 but call 10?

Assume the given figure to be a delicious doughnut. Yes, now you can concentrate more on the puzzle. So you have this delicious doughnut in your refrigerator when your friends come knocking at the door. There are eight of them. Now you have to make three cuts in this doughnut so that each one of you nine people can enjoy a piece of it. Neither you nor your friends would mind the size of their piece as long as they are getting it. How will you do it?

Which word is least like the others? Third, fourth, fifth, sixth, seventh, eighth, ninth?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

An inspection by the superintendent of St. Joseph School was scheduled on the next day. The class teacher Jenifer knew that he would be asking questions from her class and she would have to choose a pupil to answer. To offer a perfect impression over him, the teacher explained certain instructions to the students to maximise the chances of getting correct answer every time.

What did she say to the students?

What can you deduce from the following BrainBat?

CRY
LMKI