John and his Apples

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?




Similar Riddles

You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.

What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?

Asked by Neha on 28 Apr 2023


It walks on 4 when its young, walks on 2 when it's older, and walks on 3 when its very old?

Asked by Neha on 17 Jul 2021

A man died, leaving $10,000,000 for his widow, 5 sons and 4 daughters. Each daughter received an equal amount, each son received twice as much as a daughter, and the widow received three times as much as a son.

How much did the widow receive?

Asked by Neha on 17 Jan 2026


The sum of a mother, her baby and her dog's weight is 170 Kg. How much does the baby weigh if the mother weighs 100 kg more than the combined weight of the baby and the dog, and the dog weighs 60 per cent less than the baby?

Asked by Neha on 01 Feb 2025

Complete the given grid with valid words. You can only use the letters AAEEIIMMPPTT.

Hint: The grid reads the same across as down.

English Winglish

Asked by Neha on 18 Jun 2024

There is one thing that goes round the house and also inside the house but never even share a brief touch. What is it?

Asked by Neha on 28 May 2021


I never stop running even when I standstill. If I am formed by joining two identical bodies together, can you guess who I am?

Asked by Neha on 28 Mar 2023

On a special event at the prison, 5 prisoners John, Jacob, Krist, Tang, and Dang given a chance to go to a sauna and can bring one thing with them.

Following are the things that the prisoners bring with them.
John: A soda
Jacob: Thermos
Krist: Book named "How to kill"
Tang: A Walkman
Dang: Harmonica

Since it is a Sauna, no one can see each other. After a while When the steam is switched, Tang was found dead and there was blood all around.
J Bond was called and he instantly come to know who can be the murderer. How?

Asked by Neha on 07 Jul 2024

At a Society election for president, precisely 963 votes were cast.
There is a total of 4 candidates that participate in the election.

The winning candidate exceeds the opponents by 53, 79 and 105 votes.

How many votes do each candidate gets?

Asked by Neha on 04 Aug 2024


There is a river to cross using a river raft and there are eight people (father, mother, policeman, thief, 2 daughters and 2 sons). No one knows to operate the raft except the adults and also excluding the thief. Only two people can go in the raft at a time. The raft should keep coming back and forth in order to pick and drop the people.
Rules to be followed:
Father: the father cannot stay in the raft or outside the raft without the presence of the mother.
Mother: the mother cannot stay in the raft or outside the rat without the presence of the father.
Thief: the thief is not allowed to stay with any of the family members unless there is a policeman.
Policeman: the policeman can travel with anyone.
2 sons and 2 daughters: they are not allowed to travel in the raft without the presence of an adult. They cannot either travel in the presence of only thieves without the policeman. The sons cannot be with their mothers without their father's supervision. The daughters are not allowed to be there with their fathers without the supervision of their mothers. But the daughters and the sons can be left unsupervised (as long as the other rules are applied).
What is the sequence that the people should follow in order to cross the river through the raft keeping in mind all the rules?
The rules are applicable not only in the raft but also outside the raft.

Asked by Neha on 14 Aug 2023

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki