Two Have Ten
This is what you use to write
But it is not a pen
One of these has five fingers
And two of them have ten
But it is not a pen
One of these has five fingers
And two of them have ten
Hint:
Five Prom Couples Riddle
Five couples went to the prom as a group. The boys' names were Mark, Quintin, Jim, Bob, and James. The girls' names were Amanda, Betty, Susan, Jessica, and Jasmin. Each couple wore matching colors of either blue, yellow, red, green, or pink. Match the dates and the color they are wearing.
1) Two couples have the same first letter in their name. One of those letters is "B".
2) Susan wore red and Jessica wore blue.
3) Susan has more letters in her name than her date does.
4) Neither Mark nor Quintin went with Jasmin, who was wearing yellow.
5) Amanda went with Jim and they did not wear green.
1) Two couples have the same first letter in their name. One of those letters is "B".
2) Susan wore red and Jessica wore blue.
3) Susan has more letters in her name than her date does.
4) Neither Mark nor Quintin went with Jasmin, who was wearing yellow.
5) Amanda went with Jim and they did not wear green.
Hint:
Mark and Susan wore red.
Quintin and Jessica wore blue.
Jim and Amanda wore pink.
Bob and Betty wore green.
James and Jasmin wore yellow. Did you answer this riddle correctly?
YES NO
Quintin and Jessica wore blue.
Jim and Amanda wore pink.
Bob and Betty wore green.
James and Jasmin wore yellow. Did you answer this riddle correctly?
YES NO
Dracula's Dog Riddle
Hint:
Changing Two Lives Forever
Fourteen letters, its q question that can change two lives forever.' Starts with a W and ends with ME.
What questions is it?
What questions is it?
Hint:
Random Slamming Doors
This place has hardly any lights
But a lot of creaking floors
There are all kinds of strange noises
And some random slamming doors
Where is this place?
But a lot of creaking floors
There are all kinds of strange noises
And some random slamming doors
Where is this place?
Hint:
The Blind Mammals Riddle
The fact this mammal has webbed wings
Makes it a one of a kind
And contrary to the saying
None of these creatures are blind
What are these mammals?
Makes it a one of a kind
And contrary to the saying
None of these creatures are blind
What are these mammals?
Hint:
A Bath Without Water
Hint:
Wet Coat Riddle
Hint:
Ears On An Engine Riddle
Hint:
Three People In A Room
Three people enter a room and have a green or blue hat placed on their head. They cannot see their own hat, but can see the other hats.
The color of each hat is purely random. They could all be green, or blue, or any combination of green and blue.
They need to guess their own hat color by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $50,000 each, but if anyone guess incorrectly they all get nothing.
What is the best strategy?
The color of each hat is purely random. They could all be green, or blue, or any combination of green and blue.
They need to guess their own hat color by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $50,000 each, but if anyone guess incorrectly they all get nothing.
What is the best strategy?
Hint:
Simple strategy: Elect one person to be the guesser, the other two pass. The guesser chooses randomly 'green' or 'blue'. This gives them a 50% chance of winning.
Better strategy: If you see two blue or two green hats, then write down the opposite color, otherwise write down 'pass'.
It works like this ('-' means 'pass'):
Hats: GGG, Guess: BBB, Result: Lose
Hats: GGB, Guess: --B, Result: Win
Hats: GBG, Guess: -B-, Result: Win
Hats: GBB, Guess: G--, Result: Win
Hats: BGG, Guess: B--, Result: Win
Hats: BGB, Guess: -G-, Result: Win
Hats: BBG, Guess: --G, Result: Win
Hats: BBB, Guess: GGG, Result: Lose
Result: 75% chance of winning! Did you answer this riddle correctly?
YES NO
Better strategy: If you see two blue or two green hats, then write down the opposite color, otherwise write down 'pass'.
It works like this ('-' means 'pass'):
Hats: GGG, Guess: BBB, Result: Lose
Hats: GGB, Guess: --B, Result: Win
Hats: GBG, Guess: -B-, Result: Win
Hats: GBB, Guess: G--, Result: Win
Hats: BGG, Guess: B--, Result: Win
Hats: BGB, Guess: -G-, Result: Win
Hats: BBG, Guess: --G, Result: Win
Hats: BBB, Guess: GGG, Result: Lose
Result: 75% chance of winning! Did you answer this riddle correctly?
YES NO
100 Blank Cards Riddle
Someone offers you the following deal:
There is a deck of 100 initially blank cards. The dealer is allowed to write ANY positive integer, one per card, leaving none blank. You are then asked to turn over as many cards as you wish. If the last card you turn over is the highest in the deck, you win; otherwise, you lose.
Winning grants you $50, and losing costs you only the $10 you paid to play.
Would you accept this challenge?
There is a deck of 100 initially blank cards. The dealer is allowed to write ANY positive integer, one per card, leaving none blank. You are then asked to turn over as many cards as you wish. If the last card you turn over is the highest in the deck, you win; otherwise, you lose.
Winning grants you $50, and losing costs you only the $10 you paid to play.
Would you accept this challenge?
Hint: Perhaps thinking in terms of one deck is the wrong approach.
Yes!
A sample strategy:
Divide the deck in half and turn over all lower 50 cards, setting aside the highest number you find. Then turn over the other 50 cards, one by one, until you reach a number that is higher than the card you set aside: this is your chosen "high card."
Now, there is a 50% chance that the highest card is contained in the top 50 cards (it is or it isn't), and a 50% chance that the second-highest card is contained in the lower 50. Combining the probabilities, you have a 25% chance of constructing the above situation (in which you win every time).
This means that you'll lose three out of four games, but for every four games played, you pay $40 while you win one game and $50. Your net profit every four games is $10.
Obviously, you have to have at least $40 to start in order to apply this strategy effectively. Did you answer this riddle correctly?
YES NO
A sample strategy:
Divide the deck in half and turn over all lower 50 cards, setting aside the highest number you find. Then turn over the other 50 cards, one by one, until you reach a number that is higher than the card you set aside: this is your chosen "high card."
Now, there is a 50% chance that the highest card is contained in the top 50 cards (it is or it isn't), and a 50% chance that the second-highest card is contained in the lower 50. Combining the probabilities, you have a 25% chance of constructing the above situation (in which you win every time).
This means that you'll lose three out of four games, but for every four games played, you pay $40 while you win one game and $50. Your net profit every four games is $10.
Obviously, you have to have at least $40 to start in order to apply this strategy effectively. Did you answer this riddle correctly?
YES NO
The Secret Santa Exchange
A group of ten friends decide to exchange gifts as secret Santas. Each person writes his or her name on a piece of paper and puts it in a hat. Then each person randomly draws a name from the hat to determine who has him as his or her secret Santa. The secret Santa then makes a gift for the person whose name he drew.
When it's time to exchange presents, each person walks over to the person he made the gift for and holds his or her left hand in his right hand.
What is the probability that the 10 friends holding hands form a single continuous circle?
When it's time to exchange presents, each person walks over to the person he made the gift for and holds his or her left hand in his right hand.
What is the probability that the 10 friends holding hands form a single continuous circle?
Hint: It's not as difficult as it seems.
It's the number of ways the friends can form a circle divided by the number of ways the names can be drawn out of the hat.
1/10
For a group of n friends, there are n! (n factorial) ways to draw the names out of the hat. Since a circle does not have a beginning and end, choose one person as the beginning and end of the circle. There are now (n-1)! ways to distribute the remaining people around the circle. Thus the probability of forming a single circle is
(n-1)! / n!
Since n! = (n-1)! * n (for n > 1), this can be rewritten as
(n-1)! / (n*(n-1)!)
Factoring out the (n-1)! from the numerator and denominator leaves
1/n
as the probability. Did you answer this riddle correctly?
YES NO
For a group of n friends, there are n! (n factorial) ways to draw the names out of the hat. Since a circle does not have a beginning and end, choose one person as the beginning and end of the circle. There are now (n-1)! ways to distribute the remaining people around the circle. Thus the probability of forming a single circle is
(n-1)! / n!
Since n! = (n-1)! * n (for n > 1), this can be rewritten as
(n-1)! / (n*(n-1)!)
Factoring out the (n-1)! from the numerator and denominator leaves
1/n
as the probability. Did you answer this riddle correctly?
YES NO
The Prime Number Riddle
Two hundred people in an auditorium are asked to think of a single digit number from 1 to 9 inclusive and write it down. All those who wrote down a prime number are now asked to leave. Ninety people remain behind in the hall. How many of these are expected to have written down an odd number?
Hint: Remember that 1 is not a prime number.
Those that remain behind must have written {1,4,6,8,9} and from this only {1,9} are odd. The probability of an odd number is thus 2/5.
Expected number of odds is 2/5 * 90 = 36 Did you answer this riddle correctly?
YES NO
Expected number of odds is 2/5 * 90 = 36 Did you answer this riddle correctly?
YES NO
Non Bouncing Ball Riddle
Hint:
Reindeer Virus Riddle
Hint:
Add Your Riddle Here
Have some tricky riddles of your own? Leave them below for our users to try and solve.