Elephant Head

There are forty elephants and they have forty-fore heads. How can this be possible?




Similar Logic Riddles

Can you divide numbers from 1 to 9 (1 2 3 4 5 6 7 8 9) into two groups so that the sum of the numbers of each group is equal?

Note: 9 cannot be turned over to make it 6.

Asked by Neha on 19 Jul 2023


A man says, "Brothers and sisters, have I none, but that man's father is my father's son." Who is that man?

Asked by Neha on 03 Jul 2023

You and your two friends are working in a multinational company. How can you three find out the average salary of you all without disclosing your own salary to the other two?

Asked by Neha on 26 Nov 2025


John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?

Asked by Neha on 19 Oct 2024

A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

Asked by Neha on 01 Apr 2024

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?

Asked by Neha on 24 Aug 2023


Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

Asked by Neha on 03 Feb 2024

I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

Asked by Neha on 12 Mar 2023

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

Asked by Neha on 06 Sep 2021


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?

Asked by Neha on 05 Mar 2025

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