You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.

Who is the most intelligent primate in the room?

What mathematical symbol can be put between 5 and 9, to get a number bigger than 5 and smaller than 9?

If EELS + MARK + BEST + WARY = EASY

What does HELP + BARK + WARD + LEAD equal?

A maths symbol is hidden in the below Bar Graph. Can you decipher it?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

What is at the end of a rainbow?

John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.

John and Jill possess many padlocks but neither one of them has the other key.

Can you find a way John can send the ring to Jill safely?

Outside a massage parlour, there is a board that reads
"I only massage those who do not massage themselves."

Reading the above statement, does the masseur massage himself?

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?

There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.

How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?