Trombone Playground Equipment Riddle
Hint:
A Zucchini's Favorite Game Riddle
Hint:
A Baby's Favorite Reptile Riddle
Hint:
Born In London Riddle
Simon Simpleton was born in London, England.
His mother was Welsh and his father Scottish.
When Simon was eight his mother died.
When Simon was ten his father married an Irish women and suddenly Simon had an Irish sister.
When Simon was twenty four he graduated as a lawyer and took a job in Edinburgh, Scotland.
He is now sixty six.
Why can he not be buried on the banks of Loch Lomond in his favorite village of Luss, in Bonnie Scotland?
His mother was Welsh and his father Scottish.
When Simon was eight his mother died.
When Simon was ten his father married an Irish women and suddenly Simon had an Irish sister.
When Simon was twenty four he graduated as a lawyer and took a job in Edinburgh, Scotland.
He is now sixty six.
Why can he not be buried on the banks of Loch Lomond in his favorite village of Luss, in Bonnie Scotland?
Hint:
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:
Part Of Your Body
I can hold things but Im not a bag
Im used to write things down but Im not a pen
I have digits but Im not a cellphone
I have nails but Im not a hook
Im part of your body but Im not a foot
I am a?
Im used to write things down but Im not a pen
I have digits but Im not a cellphone
I have nails but Im not a hook
Im part of your body but Im not a foot
I am a?
Hint:
Favorite Christmas Carol
Hint:
Bliss To Two
Of no use to one,
Yet absolute bliss to two.
The small boy gets it for nothing.
The young man has to lie or work for it.
The old man has to buy it.
The babys right,
The lovers privilege,
The hypocrites mask.
To the young girl, faith;
To the married woman, hope;
To the old maid, charity.
What am I?
Yet absolute bliss to two.
The small boy gets it for nothing.
The young man has to lie or work for it.
The old man has to buy it.
The babys right,
The lovers privilege,
The hypocrites mask.
To the young girl, faith;
To the married woman, hope;
To the old maid, charity.
What am I?
Hint:
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
The Cheap Mp3 Player
My MP3 player is cheap 'n' nasty and has now broken: it is stuck on 'Shuffle'. In this mode it starts with whatever track you put it on, but then plays tracks in a random order. The only restriction is it never plays a song that's already been played that day.
I purchased my favourite murder mystery book in audio format, and put the first 6 chapters on my MP3 player. (Each chapter is exactly 1 track.) There's nothing else on my player at the moment. What is the probability that I will hear the 6 chapters in order as I listen today, without having to change tracks at all? (Obviously, I will ensure it plays chapter 1 first.)
The next day I empty the player before putting on the next 6 chapters. This time I also transfer a CD of mine with 11 songs on. I don't mind songs coming in between the chapters of my book, as long as the chapters are in order. What's the probability of that happening now?
I purchased my favourite murder mystery book in audio format, and put the first 6 chapters on my MP3 player. (Each chapter is exactly 1 track.) There's nothing else on my player at the moment. What is the probability that I will hear the 6 chapters in order as I listen today, without having to change tracks at all? (Obviously, I will ensure it plays chapter 1 first.)
The next day I empty the player before putting on the next 6 chapters. This time I also transfer a CD of mine with 11 songs on. I don't mind songs coming in between the chapters of my book, as long as the chapters are in order. What's the probability of that happening now?
Hint:
With only 6 tracks on the player:
The first chapter has been set to play first. The probability of the next 5 chapters playing in order is 1/5! = 1/120.
With the music on the player as well:
Seeing as I don't care about when the music plays, it doesn't change anything. The answer is still 1/120. Did you answer this riddle correctly?
YES NO
The first chapter has been set to play first. The probability of the next 5 chapters playing in order is 1/5! = 1/120.
With the music on the player as well:
Seeing as I don't care about when the music plays, it doesn't change anything. The answer is still 1/120. 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
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
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
Knights Of The Round Table Riddle
King Arthur, Merlin, Sir Lancelot, Sir Gawain, and Guinevere decide to go to their favorite restaurant to share some mead and grilled meats. They sit down at a round table for five, and as soon as they do, Lancelot notes, "We sat down around the table in age order! What are the odds of that?"
Merlin smiles broadly. "This is easily solved without any magic." He then shared the answer. What did he say the odds were?
Merlin smiles broadly. "This is easily solved without any magic." He then shared the answer. What did he say the odds were?
Hint: Does it matter if they are sitting clockwise or counterclockwise? Or where the oldest sits?
The odds are 11:1. (The probability is 1/12.)
Imagine they sat down in age order, with each person randomly picking a seat. The first person is guaranteed to pick a seat that "works". The second oldest can sit to his right or left, since these five can sit either clockwise or counterclockwise. The probability of picking a seat that works is thus 2/4, or 1/2. The third oldest now has three chairs to choose from, one of which continues the progression in the order determined by the second person, for a probability of 1/3. This leaves two seats for the fourth oldest, or a 1/2 chance. The youngest would thus be guaranteed to sit in the right seat, since there is only one seat left. This gives 1 * 1/2 * 1/3 * 1/2 * 1 = 1/12, or 11:1 odds against. Did you answer this riddle correctly?
YES NO
Imagine they sat down in age order, with each person randomly picking a seat. The first person is guaranteed to pick a seat that "works". The second oldest can sit to his right or left, since these five can sit either clockwise or counterclockwise. The probability of picking a seat that works is thus 2/4, or 1/2. The third oldest now has three chairs to choose from, one of which continues the progression in the order determined by the second person, for a probability of 1/3. This leaves two seats for the fourth oldest, or a 1/2 chance. The youngest would thus be guaranteed to sit in the right seat, since there is only one seat left. This gives 1 * 1/2 * 1/3 * 1/2 * 1 = 1/12, or 11:1 odds against. Did you answer this riddle correctly?
YES NO
Favorite Drink Riddle
A man goes out drinking every night, returning to his home in the wee hours of every morning. No matter how much he drinks, he never gets a hangover. This drink is very well known, but is rarely consumed, served warm and taken straight from its source. The man is a sucker for a free drink, especially since he can't live without it. What is his favorite drink?
Hint:
Add Your Riddle Here
Have some tricky riddles of your own? Leave them below for our users to try and solve.