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 ?

On a certain day, John celebrated his birthday. Two days later, his older twin brother Jacob celebrated his birthday.

Is this even possible? How can it be?

John went to meet his friend Jacob, but when he was about to reach the main gate, John notices that Jacob had a mighty dog who was fastened to the tree. The chain is long enough that it allows the dog to reach the main gate.

How can the John reach the main gate?

The captain of a ship was telling this interesting story: "We travelled the sea far and wide. At one time, two of my sailors were standing on opposite sides of the ship. One was looking west and the other one east. And at the same time, they could see each other clearly." How can that be possible?

In a particular village, only two barbershops exist.

The first shop has a handsome barber with a neat haircut who is handsomely dressed in clean clothes and is extremely humble with his body language. The place is clean and looks hygienic.

In the second shop, you can find a barber with shabby clothing. His hairs are weirdly cut and his clothes still have the stains from last night's dinner. The place is not clean as well and reeks a bit.

You visit the village for the first time and decide to get your haircut. Which barbershop will you like to go for that and why?

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?

2, 3, 5, 9, 17, _ What is the next number in the sequence?

Find the next number in the series

12, 20, 40, 72, 116, 172 ?

What number comes next in this sequence:
7 8 5 5 3 4 4 _

What Time Should the last watch show in the below figure?