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 ?

Solve the following series:
AZ, GT, MN, __, YB

You have 1023 apples and 10 bags. You have to distribute these apples in these 10 bags in any way you choose. But when I ask for a certain number of apples you have to give them in terms of bags without transferring the apples from other bags. How do you distribute the apples?

P is the father of Q and S is the son of R. T is the brother of P and has a daughter U. If R is the sister of P, then what is the relation between U, Q and S?

If,

Akriti = 631
Levis = 521
Sroti = 521
Aneel = 533
Then,
Sunil =?

Solve the equation in the image by looking at the pattern closely.

Can you find a pattern and the missing number in the series given below?

100, 155, 258,? , 584, 819.

How many cubic feet of dirt are in a hole of one foot deep, three feet long, and two feet wide?

The first box has two white balls. The second box has two black balls. The third box has a white and a black ball.

Boxes are labeled but all labels are wrong!

You are allowed to open one box, pick one ball at random, see its colour and put it back into the box, without seeing the colour of the other ball.

How many such operations are necessary to correctly label the boxes?

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?