There are three boxes. One is labeled "APPLES" another is labeled "ORANGES". The last one is labeled "APPLES AND ORANGES". You know that each is labeled incorrectly. You may ask me to pick one fruit from one box which you choose.

How can you label the boxes correctly?

Find the value of "?" in the ball picture Riddle below:

Place a mathematical symbol between the numerals 5 and 9 in such a way that the resulting number is greater than 5 but smaller than 9.

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

Can you think of any three-dimensional shape that comprises of exactly two surfaces?

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?

By what process could you make a 'Tea-Table' into food?

By moving just one matchstick, you need to make the below statement true. Can you do it?

A deaf and mute man goes to the train station. Tickets for the train are 50 cents each. The man goes to the ticket booth and hands the man inside just a dollar. The man in the booth hands him two tickets.

How did the man in the booth know to give him two tickets without even looking at him?

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?