When Is A Door Not A Door Riddle
Hint:
The Door Knocker Winner
Hint:
The Train Of Love
A young man, living in Manhattan, New York, has two girlfriends. One lives to the North, in the Bronx, and the other lives to the South, in Brooklyn.
He likes both girls equally but can only visit one each weekend. He therefore leaves it to chance and takes the first train that arrives when he reaches the train station.
Even though the man arrives at a totally random time every Saturday morning and the Brooklyn and Bronx trains arrive equally often (every ten minutes), he finds himself visiting the girl in Brooklyn on average nine times out of ten. How could the odds so heavily favor taking the Brooklyn train?
He likes both girls equally but can only visit one each weekend. He therefore leaves it to chance and takes the first train that arrives when he reaches the train station.
Even though the man arrives at a totally random time every Saturday morning and the Brooklyn and Bronx trains arrive equally often (every ten minutes), he finds himself visiting the girl in Brooklyn on average nine times out of ten. How could the odds so heavily favor taking the Brooklyn train?
Hint: Think of a way the train schedules might favor one train over the other.
The Brooklyn train leaves exactly 1 minute before the Bronx train.
Let's say the Brooklyn train arrives at 09:00, 09:10, 09:20, etc. and the Bronx train arrives one minute after at 09:01, 09:11, 09:21, etc. Consider the ten minute interval from 09:00 to 09:10. If the man arrives between 09:00 and 09:01, the 09:01 Bronx train will be the first to arrive (assuming that he doesn't arrive at exactly 09:00). If the man arrives between 09:01 and 09:10, the 09:10 Brooklyn train will be the first to arrive. In any ten minute period, the Brooklyn train will be the first to arrive in nine of the ten minutes. Did you answer this riddle correctly?
YES NO
Let's say the Brooklyn train arrives at 09:00, 09:10, 09:20, etc. and the Bronx train arrives one minute after at 09:01, 09:11, 09:21, etc. Consider the ten minute interval from 09:00 to 09:10. If the man arrives between 09:00 and 09:01, the 09:01 Bronx train will be the first to arrive (assuming that he doesn't arrive at exactly 09:00). If the man arrives between 09:01 and 09:10, the 09:10 Brooklyn train will be the first to arrive. In any ten minute period, the Brooklyn train will be the first to arrive in nine of the ten minutes. Did you answer this riddle correctly?
YES NO
The Uncharted Island Riddle
A plane containing 5 people crashes into an uncharted island, and all of them survive for a limit of 5 days. 2 of them build themselves graves and die in it from the hard work. 1 person fills one of the graves with dirt and then dies next to it on day 3. The last two people build 3 graves, and put in one of the corpses, but 5 years later, 11 people are not in their graves, yet the graves are full of corpses. How?
Hint:
On day four, the last two survivours(who are different sexes)found food which will last each of them 4 more years, and on the fifth day, they began reproducing. By the fourth year, ten children have been taught how to raise themselves. The children were thoughtful and put their corpses in the grave. Did you answer this riddle correctly?
YES NO
YES NO
Fifty One Bicycles
Hint:
The man was playing a poker game and cheated. The bicycles are a type of card. Did you answer this riddle correctly?
YES NO
YES NO
Like The Sun Riddle
Hint:
A Man In The Shadows Riddle
Hint:
Piping Hot Water Riddle
Late afternoons I often bathe. I'll soak in water piping hot. My essence goes through my see through clothes. Used up am I; I've gone to pot.
I am a?
I am a?
Hint:
Marrying The Princess Riddle
A king wants his daughter to marry the smartest of 3 extremely intelligent young princes, and so the king's wise men devised an intelligence test.
The princes are gathered into a room and seated, facing one another, and are shown 2 black hats and 3 white hats. They are blindfolded, and 1 hat is placed on each of their heads, with the remaining hats hidden in a different room.
The king tells them that the first prince to deduce the color of his hat without removing it or looking at it will marry his daughter. A wrong guess will mean death. The blindfolds are then removed.
You are one of the princes. You see 2 white hats on the other prince's heads. After some time you realize that the other prince's are unable to deduce the color of their hat, or are unwilling to guess. What color is your hat?
The princes are gathered into a room and seated, facing one another, and are shown 2 black hats and 3 white hats. They are blindfolded, and 1 hat is placed on each of their heads, with the remaining hats hidden in a different room.
The king tells them that the first prince to deduce the color of his hat without removing it or looking at it will marry his daughter. A wrong guess will mean death. The blindfolds are then removed.
You are one of the princes. You see 2 white hats on the other prince's heads. After some time you realize that the other prince's are unable to deduce the color of their hat, or are unwilling to guess. What color is your hat?
Hint: You know that your competitors are very intelligent and want nothing more than to marry the princess. You also know that the king is a man of his word, and he has said that the test is a fair test of intelligence and bravery.
Answer: White.
The king would not select two white hats and one black hat. This would mean two princes would see one black hat and one white hat. You would be at a disadvantage if you were the only prince wearing a black hat.
If you were wearing the black hat, it would not take long for one of the other princes to deduce he was wearing a white hat.
If an intelligent prince saw a white hat and a black hat, he would eventually realize that the king would never select two black hats and one white hat. Any prince seeing two black hats would instantly know he was wearing a white hat. Therefore if a prince can see one black hat, he can work out he is wearing white.
Therefore the only fair test is for all three princes to be wearing white hats. After waiting some time just to be sure, you can safely assert you are wearing a white hat. Did you answer this riddle correctly?
YES NO
The king would not select two white hats and one black hat. This would mean two princes would see one black hat and one white hat. You would be at a disadvantage if you were the only prince wearing a black hat.
If you were wearing the black hat, it would not take long for one of the other princes to deduce he was wearing a white hat.
If an intelligent prince saw a white hat and a black hat, he would eventually realize that the king would never select two black hats and one white hat. Any prince seeing two black hats would instantly know he was wearing a white hat. Therefore if a prince can see one black hat, he can work out he is wearing white.
Therefore the only fair test is for all three princes to be wearing white hats. After waiting some time just to be sure, you can safely assert you are wearing a white hat. Did you answer this riddle correctly?
YES NO
The Thirsty Sun Riddle
Hint:
A Chinese Man's Name
Hint:
New York Plane Crash Riddle
If a plane carrying passengers from New Jersey crashes in New York, where do you bury the survivors?
Hint:
Losing A New York Bet
You are hanging around in NYC when a person approaches you.
"Leaving the bald people aside, I can bet a hundred bucks that there are two people living in NYC who have same number of hairs on their heads," he says to you.
You say that you will take the bet. After talking to the man for a couple of minutes, you realize that you have lost the bet.
What did the person say to you that proved his statement ?
"Leaving the bald people aside, I can bet a hundred bucks that there are two people living in NYC who have same number of hairs on their heads," he says to you.
You say that you will take the bet. After talking to the man for a couple of minutes, you realize that you have lost the bet.
What did the person say to you that proved his statement ?
Hint:
This problem can be best solved using the pigeonhole principle.
The argument will go like this:
Assume that all the non-bald people in NYC have different number of hairs on their head. The population is about 9 million and let us assume that there are 8 million among them who are not bald.
Now, those 8 million people need to have different number of hairs. On an average, people have just 100, 000 hairs on their head. If we keep on assuming that there is someone with just one hair, someone with two, someone with three and so on, there will be 7, 900, 00 other people left who will have more than 100, 000 hairs on their head and need different number of hairs.
Now, as per this assumption, if we keep increasing one hair for each person, to make everybody hair different in numbers, we will come across someone with 8, 000, 000 hairs. But that is practically impossible (even 1, 000, 000 is impossible). Thus there must be two people who are having same number of hairs. Did you answer this riddle correctly?
YES NO
The argument will go like this:
Assume that all the non-bald people in NYC have different number of hairs on their head. The population is about 9 million and let us assume that there are 8 million among them who are not bald.
Now, those 8 million people need to have different number of hairs. On an average, people have just 100, 000 hairs on their head. If we keep on assuming that there is someone with just one hair, someone with two, someone with three and so on, there will be 7, 900, 00 other people left who will have more than 100, 000 hairs on their head and need different number of hairs.
Now, as per this assumption, if we keep increasing one hair for each person, to make everybody hair different in numbers, we will come across someone with 8, 000, 000 hairs. But that is practically impossible (even 1, 000, 000 is impossible). Thus there must be two people who are having same number of hairs. Did you answer this riddle correctly?
YES NO
New York Multiplication Riddle
Hint:
Dracula In New York Riddle
Hint:
Add Your Riddle Here
Have some tricky riddles of your own? Leave them below for our users to try and solve.