Question: A man in New York City has $10. He spends $6.50 on flowers, and $3 on lunch (hot coffee and a hot dog). He then gets on the subway which will take him 7 stops for 50 cents. But he is forced to get off of the subway just 5 stops away from where he began.
Why is this?
Answer: When he gets on the subway it is 6 stops away from the end of the line (end of the track). So when it reaches this point it begins to work backwards. So when it goes back one stop he has traveled 7 stops but is only 5 away from where he began.
Question: What is the next number in the sequence? 1 11 21 1211 111221 312211
Answer: The next number it: 13112221. Each number describes the previous number. Starting with 1, the second line describes it 11 (one 1). Then the third line describes 11 as 21 (two 1's). Then the fourth line describes 21 as 1211 (one 2, one 1). This is the pattern.
Question: I'm teary-eyed but never cry.
Silver-tongued, but never lie.
Double-winged, but never fly.
Air-cooled, but never dry.
What am I?
Answer: Mercury. The element looks shiny, silver, and is wet. The god Mercury has two wings but only uses them to run.
Question: A man is found dead in a phone booth in a pool of blood. The glass on either end of the phone booth is broken and the phone is hanging. Just outside of the phone booth is a bucket and a stick.
Answer: The man was a fisherman and was telling somebody on the phone about the large fish he caught. When he used his hands to gesture how big the fish was he hit the glass breaking it and cutting himself.
Question: Ants on a stick may only move left or right. If they bump into each other they bounce off of each other and immediately move in the opposite direction maintaining speed the entire time. The only time they change speed is when they fall off of the edge of the stick.
If 25 ants are randomly put on a 1 meter long stick moving 1 meter per second, what is the longest amount of time it could take for them to all fall off?
Answer: The answer is 1 second.
Imagine that each ant is holding a flag and that when an ant bumps into another ant it gives its flag to the other ant. In this way, every ant always has a flag and a flag would never change direction. So each flag would head towards the edge at a rate of 1 meter per second and since the stick is 1 meter long, it would only take 1 second at most for each flag to fall off, and in turn, each ant.
Question: A very famous chemist was found murdered in his kitchen today. The police have narrowed it down to six suspects. They know it was a two man job. Their names: Felice, Maxwell, Archibald, Nicolas, Jordan, and Xavier.
A note was also found with the body: '26-3-58/28-27-57-16'.
Who are the killers?
Answer: Felice and Nicholas are the murderers. The numbers correspond to atomic numbers on the periodic table of elements: 'Fe-Li-Ce/Ni-Co-La-S'.
Question: You have a bag with 'N' strings in it. You randomly grab two ends and tie them together until there are no more loose ends.
In the end, what is the expected number of loops (strings tied to their own end)?
Answer: 1 + 1/3 + 1/5 ... + 1/(2N-1).
Each time you tie two together the number of string ends available decreases by 2. The chance of grabbing a string and its end is 1/(2N-1).
Question: Three gods A, B, and C are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of A, B, and C by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which.
What three questions can you ask?
Answer: A possible solution is:
Q1: Ask god B, "If I asked you 'Is A Random?', would you say ja?". If B answers ja, either B is Random (and is answering randomly), or B is not Random and the answer indicates that A is indeed Random. Either way, C is not Random. If B answers da, either B is Random (and is answering randomly), or B is not Random and the answer indicates that A is not Random. Either way, you know the identity of a god who is not Random.
Q2: Go to the god who was identified as not being Random by the previous question (either A or C), and ask him: "If I asked you 'Are you False?', would you say ja?". Since he is not Random, an answer of da indicates that he is True and an answer of ja indicates that he is False.
Q3: Ask the same god the question: "If I asked you 'Is B Random?', would you say ja?". If the answer is ja, B is Random; if the answer is da, the god you have not yet spoken to is Random. The remaining god can be identified by elimination.
For more information about the answer visit the following Wikipedia page.
Question: There is a party of 100 high-powered politicians. All of them are either honest or liars. You walk in knowing two things:
- At least one of them is honest.
- If you take any two politicians, at least one of them is a liar.
From this information, can you know how many are liars and how many are honest?
Answer: Yes, from the information you know 1 is honest and 99 are liars.
One of them is honest satisfying the first piece of information. Then if you take the honest man and any other politician, the other politician must be a liar to satisfy the second piece of information, 'If you take any two politicians, at least one of them is a liar.' So 99 are liars.
Question: There are 1600 people sitting around a circular table. The first person (person 1) has a sword and kills the second person then hands it to the next alive person (in this case person 3). Person 3 stabs person 4 and gives the sword to person 5. This goes on until person 1499 kills person 1500. Then person 1 kills person 3 and so on. This is repeated until there is only a single person remaining.
Who remains in the end?
Answer: Person 1153.
If you have any number of people equal to a power of 2 (2, 4, 8, etc.) then the first person will be the last remaining. The closest power of 2 to 1600 is 1024 (210). So the first person to go of the 1600 when there is 1024 people left will be the last person remaining. 1600 - 1024 = 576. 576 * 2 = 1152. Person 1152 will be the 576th person killed and person 1153 will be the first person to go of the remaining 1024 people.
Follow us and get the Riddle of the Day, Joke of the Day, and interesting updates.