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 Traffic Light Riddle
There is a traffic light at the top of a hill. Cars can't see the light until they are 200 feet from the light.
The cycle of the traffic light is 30 seconds green, 5 seconds yellow and 20 seconds red.
A car is traveling 45 miles per hour up the hill.
What is the probability that the light will be yellow when the driver first crests the hill and that if the driver continues through the intersection at her present speed that she will run a red light?
The cycle of the traffic light is 30 seconds green, 5 seconds yellow and 20 seconds red.
A car is traveling 45 miles per hour up the hill.
What is the probability that the light will be yellow when the driver first crests the hill and that if the driver continues through the intersection at her present speed that she will run a red light?
Hint:
The probability of the driver encountering a yellow light and the light turning red before the car enters the intersection is about 5.5%.
At 45 mph the car is traveling at 66 feet/second and will take just over 3 seconds (3.03) to travel the 200 feet to the intersection. Any yellow light that is in the last 3.03 seconds of the light will cause the driver to run a red light.
The entire cycle of the light is 55 seconds. 3.03/55 = 5.5%. Did you answer this riddle correctly?
YES NO
At 45 mph the car is traveling at 66 feet/second and will take just over 3 seconds (3.03) to travel the 200 feet to the intersection. Any yellow light that is in the last 3.03 seconds of the light will cause the driver to run a red light.
The entire cycle of the light is 55 seconds. 3.03/55 = 5.5%. Did you answer this riddle correctly?
YES NO
Passing 2nd Place
Hint:
You would be in 2nd place. You passed the person in second place, not first. Did you answer this riddle correctly?
YES NO
YES NO
Giving You Your Sight
Although its not a curtain
This gets closed every night
So that you can go to sleep
Its what gives you your sight
It is...
This gets closed every night
So that you can go to sleep
Its what gives you your sight
It is...
Hint:
Two On Your Face
This thing has some lashes
But it is not a whip
Its able to be closed
But it is not a zip
Its part of your body
But it is not a hip
There are two on your face
But it is not a lip
What could it be?
But it is not a whip
Its able to be closed
But it is not a zip
Its part of your body
But it is not a hip
There are two on your face
But it is not a lip
What could it be?
Hint:
Unwilling To Kiss
First think of the person who lives in disguise,
Who deals in secrets and tells naught but lies.
Next, tell me whats always the last thing to mend,
The middle of middle and end of the end?
And finally give me the sound often heard
During the search for a hard-to-find word.
Now string them together, and answer me this,
Which creature would you be unwilling to kiss?
Who deals in secrets and tells naught but lies.
Next, tell me whats always the last thing to mend,
The middle of middle and end of the end?
And finally give me the sound often heard
During the search for a hard-to-find word.
Now string them together, and answer me this,
Which creature would you be unwilling to kiss?
Hint:
The Quietest Whimper
I talk, but I do not speak my mind
I hear words, but I do not listen to thoughts
When I wake, all see me
When I sleep, all hear me
Many heads are on my shoulders
Many hands are at my feet
The strongest steel cannot break my visage
But the softest whisper can destroy me
The quietest whimper can be heard.
What am I?
I hear words, but I do not listen to thoughts
When I wake, all see me
When I sleep, all hear me
Many heads are on my shoulders
Many hands are at my feet
The strongest steel cannot break my visage
But the softest whisper can destroy me
The quietest whimper can be heard.
What am I?
Hint:
Without A Father Riddle
Hint:
Bedtime With Monsters Riddle
Hint:
Brainy Monsters Riddle
Hint:
A Queen's Twins Riddle
A Queen has twins by Caesarean section so it's impossible to tell who was born first. Now the twins are adults and ready to rule. One is intensely stupid, while the other is highly intelligent, well loved and charismatic. Yet the unintelligent one is chosen as the next ruler.
Why?
Why?
Hint:
The Most Important Bee
I was the name of the band
Led by Freddie Mercury
I can be found in a hive
Im the most important bee
What am I?
Led by Freddie Mercury
I can be found in a hive
Im the most important bee
What am I?
Hint:
Two Solid Metal Pillars
You are standing on the top one of two solid metal pillars. They are both exactly one kilometer apart from each other and they both stand one kilometer high. There is absolutely nothing around these pillars, but you have one small twig, one small rock and an unlimited supply of rope. Using only the materials named, how can you get from the top of the pillar that you are on to the top of the other pillar?
Hint:
The twig and the rock were simply distractions used to divert you from the real answer. Forget I ever mentioned them. All you need to do is fill the space between you with enough rope that it makes a pile so big that you can walk across it to the other pillar (remember I said you had an unlimited supply of rope). Did you answer this riddle correctly?
YES NO
YES NO
Fly Through The Air Riddle
Hop as high as a roo, bounce without a care. Youll feel so free as you fly through the air. What are you jumping on?
Hint:
Add Your Riddle Here
Have some tricky riddles of your own? Leave them below for our users to try and solve.