Logic riddles

logicmathclean

You are visiting NYC when a man approaches you. "Not counting bald people, I bet a hundred bucks that there are two people living in New York City with the same number of hairs on their heads," he tells you. "I'll take that bet!" you say. You talk to the man for a minute, after which you realize you have lost the bet. What did the man say to prove his case?
This is a classic example of the pigeonhole principle. The argument goes as follows: assume that every non-bald person in New York City has a different number of hairs on their head. Since there are about 9 million people living in NYC, let's say 8 million of them aren't bald. So 8 million people need to have different numbers of hairs on their head. But on average, people only have about 100,000 hairs. So even if there was someone with 1 hair, someone with 2 hairs, someone with 3 hairs, and so on, all the way up to someone with 100,000 hairs, there are still 7,900,000 other people who all need different numbers of hairs on their heads, and furthermore, who all need MORE than 100,000 hairs on their head. You can see that additionally, at least one person would need to have at least 8,000,000 hairs on their head, because there's no way to have 8,000,000 people all have different numbers of hairs between 1 and 7,999,999. But someone having 8,000,000 is an essential impossibility (as is even having 1,000,000 hairs), So there's no way this situation could be the case, where everyone has a different number of hairs. Which means that at least two people have the same number of hairs.
78.55 %
62 votes
logictrickysimplestory

A duke was hunting in the forest with his men-at-arms and servants when he came across a tree. Upon it, archery targets were painted and smack in the middle of each was an arrow. "Who is this incredibly fine archer?" cried the duke. "I must find him!" After continuing through the forest for a few miles he came across a small boy carrying a bow and arrow. Eventually the boy admitted that it was he who shot the arrows plumb in the center of all the targets. "You didn't just walk up to the targets and hammer the arrows into the middle, did you?" asked the duke worriedly. "No my lord. I shot them from a hundred paces. I swear it by all that I hold holy." "That is truly astonishing," said the duke. "I hereby admit you into my service." The boy thanked him profusely. "But I must ask one favor in return," the duke continued. "You must tell me how you came to be such an outstanding shot." How'd he get to be such a good shot?
The boy shot the arrow, then painted the circle around it.
78.55 %
96 votes
logicstorymath

You are standing in a house in the middle of the countryside. There is a small hole in one of the interior walls of the house, through which 100 identical wires are protruding. From this hole, the wires run underground all the way to a small shed exactly 1 mile away from the house, and are protruding from one of the shed's walls so that they are accessible from inside the shed. The ends of the wires coming out of the house wall each have a small tag on them, labeled with each number from 1 to 100 (so one of the wires is labeled "1", one is labeled "2", and so on, all the way through "100"). Your task is to label the ends of the wires protruding from the shed wall with the same number as the other end of the wire from the house (so, for example, the wire with its end labeled "47" in the house should have its other end in the shed labeled "47" as well). To help you label the ends of the wires in the shed, there are an unlimited supply of batteries in the house, and a single lightbulb in the shed. The way it works is that in the house, you can take any two wires and attach them to a single battery. If you then go to the shed and touch those two wires to the lightbulb, it will light up. The lightbulb will only light up if you touch it to two wires that are attached to the same battery. You can use as many of the batteries as you want, but you cannot attach any given wire to more than one battery at a time. Also, you cannot attach more than two wires to a given battery at one time. (Basically, each battery you use will have exactly two wires attached to it). Note that you don't have to attach all of the wires to batteries if you don't want to. Your goal, starting in the house, is to travel as little distance as possible in order to label all of the wires in the shed. You tell a few friends about the task at hand. "That will require you to travel 15 miles!" of of them exclaims. "Pish posh," yells another. "You'll only have to travel 5 miles!" "That's nonsense," a third replies. "You can do it in 3 miles!" Which of your friends is correct? And what strategy would you use to travel that number of miles to label all of the wires in the shed?
Believe it or not, you can do it travelling only 3 miles! The answer is rather elegant. Starting from the house, don't attach wires 1 and 2 to any batteries, but for the remaining wires, attach them in consecutive pairs to batteries (so attach wires 3 and 4 to the same battery, attach wires 5 and 6 to the same battery, and so on all the way through wires 99 and 100). Now travel 1 mile to the shed, and using the lightbulb, find all pairs of wires that light it up. Put a rubberband around each pair or wires that light up the lightbulb. The two wires that don't light up any lightbulbs are wires 1 and 2 (though you don't know yet which one of them is wire 1 and which is wire 2). Put a rubberband around this pair of wires as well, but mark it so you remember that they are wires 1 and 2. Now go 1 mile back to the house, and attach odd-numbered wires to batteries in the following pairs: (1 and 3), (5 and 7), (9 and 11), and so on, all the way through (97 and 99). Similarly, attach even-numbered wires to batteries in the following pairs: (4 and 6), (8 and 10), (12 and 14), and so on, all the way through (96 and 98). Note that in this round, we didn't attach wire 2 or wire 100 to any batteries. Finally, travel 1 mile back to the shed. You're now in a position to label all of the wires here. First, remember we know the pair of wires that are, collectively, wires 1 and 2. So test wires 1 and 2 with all the other wires to see what pair lights up the lightbulb. The wire from wires 1 and 2 that doesn't light up the bulb is wire 2 (which, remember, we didn't connect to a battery), and the other is wire 1, so we can label these as such. Furthermore, the wire that, with wire 1, lights up a lightbulb, is wire 3 (remember how we connected the wires this round). Now, the other wire in the rubber band with wire 3 is wire 4 (we know this from the first round), and the wire that, with wire 4, lights up the lightbulb, is wire 6 (again, because of how we connected the wires to batteries this round). We can continue labeling batteries this way (next we'll label wire 7, which is rubber-banded to wire 6, and then we'll label wire 9, which lights up the lightbulb with wire 7, and so on). At the end, we'll label wire 97, and then wire 99 (which lights up the lightbulb with wire 97), and finally wire 100 (which isn't connected to a battery this round, but is rubber-banded to wire 99). And we're done, having travelled only 3 miles!
78.50 %
56 votes
logiccleversimple

It was a grandeur party. In order to filter the uninvited guests, the security guard was assigned a task to check the secret password. The guests invited by the royal family also were shared with the secret password. John wasn't an invited guest. He learned that the password is needed to make an entry. He hides himself and started watching the guests and the security. The first guest comes. Security told him, TWELVE and the guest replied SIX. He wished him and allowed him to enter. The second guest comes. Security told him SIX and the guest replied THREE! He was too allowed. John made an entry as third guest. Security told him EIGHT and John replied FOUR. He was thrown out of the party! Why?
The answer should be five. The password is not half of the digit, but the number that represents the number of digits told by security.
78.50 %
56 votes
logicmathclever

A grandfather's clock chimes the appropriate number of times to indicate the hour, as well as chiming once at each quarter hour. If you were in another room and hear the clock chime just once, what would be the longest period of time you would have to wait in order to be certain of the correct time?
You would have to wait 90 minutes between 12:15 and 1:45. Once you had heard seven single chimes, you would know that the next chime would be two chimes for 2 o'clock.
78.50 %
56 votes
logicmathstorycleanclever

In the land of Brainopia, there are three races of people: Mikkos, who tell the truth all the time, Kikkos, who always tell lies, and Zikkos, who tell alternate false and true statements, in which the order is not known (i.e. true, false, true or false, true, false). When interviewing three Brainopians, a foreigner received the following statements: Person 1: I am a Mikko. Person 2: I am a Kikko. Person 3: a. They are both lying. b. I am a Zikko. Can you help the very confused foreigner determine who is who, assuming each person represents a different race?
Person 1 is a Miko. Person 2 is a Ziko. Person 3 is a Kikko.
78.50 %
79 votes
logicsimplecleanstory

Jack and Joe were on vacation and driving along a deserted country road from the town of Kaysville to the town of Lynnsville. They came to a multiple fork in the road. The sign post had been knocked down and they were faced with choosing one of five different directions. Since they had left their map at the last gas station and there was no one around to ask, how could Jack and Joe find their way to Lynnsville?
They need to stand the signpost up so that the arm reading Kaysville points in the direction of Kaysville, the town they had just come from. With one arm pointing the correct way, the other arms will also point in the right directions.
78.50 %
79 votes
logicmathsimpleclean

The digits 0-9(0,1,2,3,4,5,6,7,8,9) can be rearranged into 3628800 distinct 10 digits numbers. How many of these numbers are prime?
None. The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.
78.47 %
44 votes