Enter a keyword into the search box. The riddle search will check to see if the word is in the Title, Riddle, or Answer and return results if they exist.
"Ses" Riddles - Next 10 of 381.
Riddle:
This one, most students fear it, yet it is what they use everyday. These words formed it: MAT, MAT, TICKS, THE. What is it?
Answer: MATHEMATICS.
Riddle:
Since a person uses about the same amount of energy walking 2 miles as they would run for 2 miles, would a person use more energy running for 10 minutes, walking for ten minutes, or the same amount of energy?
Answer: Since a person running for 10 minutes would cover more distance than that same person would walking for 10 minutes, he would use more energy running for 10 minutes.
Riddle:
Two friends, from a very cold town in Minnesota, each had unusual life skills which helped them in their adventures together. The first of the friends was a tall, lanky individual who, at times, possessed almost super-human strength, had the ability to remember everything he ever ate, and could accurately forecast the weather by reading a bunion on his foot --- but he wasn't known for being very intelligent. The second of the friends, known for his higher intellect, made a lot of short, solo flights, but he never obtained his pilot's license. He usually wore a pair of aviation goggles on top of his head. Their arch enemies were two Russian-like spies who doggedly pursued them, and these spies were led by a man without fear. Can you name the two friends from this very cold Minnesota town?
Answer: Rocket J. Squirrel and Bullwinkle J. Moose, otherwise known as Rocky and Bullwinkle. The two Russian-like spies (Boris and Natasha) were lead by the infamous Fearless Leader.
Riddle:
Each cell has a single light bulb that is either on or off on a given day. The warden tells the mathematicians that the light system of the prison has three modes: neutral mode, where each lightbulb is independent of the others bright mode, where two bulbs turn on every day and the other turns off dark mode, where two bulbs turn off every day and the other turns on (All distributions are not necessarily uniform.) The prison starts in neutral mode. After an unknown but finite number of days, the warden will select either bright mode or dark mode, which is locked in permanently. After countably infinitely many days have passed, the mathematicians are asked which one the warden picked. They may discuss strategy before going into the cells, but there will be no communication afterwards. They have unlimited capacities to communicate and remember strategies that they come up with. Two of the three need to guess correctly to escape; how can they ensure this? You may assume that the axiom of choice holds.
Answer: The night before their first day in prison, the three mathematicians choose a non-principal ultrafilter on the set of days they are in prison. A non-principal ultrafilter is a rule for classifying some sets of days as large, and the rest as small, subject to the following conditions: Every set of days containing a large set is large, If the set of all days is partitioned into finitely many sets, exactly one set is large, and No finite set of days is large. Constructing a non-principal ultrafilter requires the axiom of choice, and communicating an ultrafilter from one mathematician to another requires an infinite amount of information. These mathematicians have unlimited mental capacity though, so maybe this is possible. After the countably infinite number of days has passed, each mathematician guesses dark mode if the set of days when their light was off is large, and guesses bright mode if the set of days their light was on is large (property 2 above guarantees that exactly one of these conditions is met). Suppose warden eventually selects dark mode. Consider the following four sets of days: neutral mode days, dark mode days when the first mathematician's light is on, dark mode days when the second mathematician's light is on, dark mode days when the third mathematician's light is on. Again, property 2 of the ultrafilter says that exactly one of these sets of days is large. By property 3, it cannot be the first, because that set is finite. This means exactly one of the mathematicians saw a light for a large set of days, so that mathematician guesses bright mode and the other two guess dark mode. Success! The argument in the case the warden selects bright mode is identical.
Riddle:
I have a face that can be read and recognized by many. My purpose is for your entertainment, and friendship. I can tell anyone everything you tell me. Or I can tell all your friends. Without John O'Sullivan helping me, I'd be nothing. What am I?
Answer: I am Facebook. Get it? John O'Sullivan and a few others created WiFi, and Facebook uses WiFi!
Riddle:
Each clue leads to word beginning with C.A.R. 1. This CAR does humorous drawings. 2. A CAR that records heartbeats. 3. A North American Reindeer. 4. Burn some sugar and you'll get .... 5. A Measure of the fineness of gold. 6. A CAR with horses that goes round & round. What are the answers?
Answer: 1. CARtoonist 2. CARdiograph 3. CARibou 4. CARamel 5. CARat 6. CARousel
Riddle:
Phrases on the internet are designated in a standard way that can also be used in a math problem or in the acronym pemdas which way would that be?
Answer: parenthesis
Riddle:
The person who sells me knows me. The person who buys me also knows me. But the person who uses me doesn't know me. What am I?
Answer: A coffin.
Riddle:
The person who buys me doesn't need me. The person who makes me doesn't want me. The person who uses me can't appreciate me. What am I?
Answer: A coffin.
Riddle:
A man went to town on Wednesday, stayed two nights and came back on Wednesday. How is this possible?
Answer: The horses name is was Wednesday.
