Difficult riddles

logicshort

Difficult pop quiz

A teacher decides to give a pop quiz one day but all of her students refuse to take the quiz thinking that the teacher will call off the quiz. She can give only one of these students a detention for skipping the quiz. All of the students know each other’s names and if a student knows he/she is getting a detention they take the quiz. How can she threaten her students with the single detention so they all take the quiz?
She tells them that she will give the student who skips the quiz whose name comes first alphabetically a detention. This student won’t skip because they know they are getting a detention if they do. The next person alphabetically will then know that they will get a detention so they won’t skip either, and so on.
93.22 %
37 votes

logicshort

Sequence of numbers

Finish the sequence: 7 8 5 5 3 4 4 ?
6 - the number of letters in the month august; (January has 7 letters, February has 8 etc.)
93.22 %
37 votes

cleanEinstein’slogic

Ships in a port

There are 5 ships in a port. The Greek ship leaves at six and carries coffee. The ship in the middle has a black chimney. The English ship leaves at nine. The French ship with a blue chimney is to the left of a ship that carries coffee. To the right of the ship carrying cocoa is a ship going to Marseille. The Brazilian ship is heading for Manila. Next to the ship carrying rice is a ship with a green chimney. A ship going to Genoa leaves at five. The Spanish ship leaves at seven and is to the right of the ship going to Marseille. The ship with a red chimney goes to Hamburg. Next to the ship leaving at seven is a ship with a white chimney. The ship on the border carries corn. The ship with a black chimney leaves at eight. The ship carrying corn is anchored next to the ship carrying rice. The ship to Hamburg leaves at six. Which ship goes to Port Said? Which ship carries tea?
The French ship.
91.55 %
50 votes

logicmathprobability

The same birthday

What is the least number of people that need to be in a room such that there is greater than a 50% chance that at least two of the people have the same birthday?
Only 23 people need to be in the room. Our first observation in solving this problem is the following: (the probability that at least 2 people have the same birthday + the probability that nobody has the same birthday) = 1.0 What this means is that there is a 100% chance that EITHER everybody in the room has a different birthday, OR at least two people in the room have the same birthday (and these probabilities don't add up to more than 1.0 because they cover mutually exclusive situations). With some simple re-arranging of the formula, we get: the probability that at least 2 people have the same birthday = (1.0 - the probability that nobody has the same birthday) So now if we can find the probability that nobody in the room has the same birthday, we just subtract this value from 1.0 and we'll have our answer. The probability that nobody in the room has the same birthday is fairly straightforward to calculate. We can think of this as a "selection without replacement" problem, where each person "selects" a birthday at random, and we then have to figure out the probability that no two people select the same birthday. The first selection has a 365/365 chance of being different than the other birthdays (since none have been selected yet). The next selection has a 364/365 chance of being different than the 1 birthday that has been selected so far. The next selection has a 363/365 chance of being different than the 2 birthdays that have been selected so far. These probabilities are multiplied together since each is conditional on the previous. So for example, the probability that nobody in a room of 3 people have the same birthday is (365/365 * 364/365 * 363/365) =~ 0.9918 More generally, if there are n people in a room, then the probability that nobody has the same birthday is (365/365 * 364/365 * ... * (365-n+2)/365 * (365-n+1)/365) We can plug in values for n. For n=22, we get that the probability that nobody has the same birthday is 0.524, and thus the probabilty that at least two people have the same birthday is (1.0 - 0.524) = 0.476 = 47.6%. Then for n=23, we get that the probability that nobody has the same birthday is 0.493, and thus the probabilty that at least two people have the same birthday is 1.0 - 0.493) = 0.507 = 50.7%. Thus, once we get to 23 people we have reached the 50% threshold.
91.22 %
48 votes

cleanlogicmystery

Burning fire

Alexander is stranded on an island covered in forest. One day, when the wind is blowing from the west, lightning strikes the west end of the island and sets fire to the forest. The fire is very violent, burning everything in its path, and without intervention the fire will burn the whole island, killing the man in the process. There are cliffs around the island, so he cannot jump off. How can the Alexander survive the fire? (There are no buckets or any other means to put out the fire)
Alexander picks up a piece of wood and lights it from the fire on the west end of the island. He then quickly carries it near the east end of he island and starts a new fire. The wind will cause that fire to burn out the eastern end and he can then shelter in the burnt area. Alexander survives the fire, but dies of starvation, with all the food in the forest burnt.
91.04 %
47 votes

logicmath

5 Pirates Fight for 100 Gold

There are 5 pirates in a ship. Pirates have hierarchy C1, C2, C3, C4 and C5.C1 designation is the highest and C5 is the lowest. These pirates have three characteristics : a. Every pirate is so greedy that he can even take lives to make more money. b. Every pirate desperately wants to stay alive. c. They are all very intelligent.There are total 100 gold coins on the ship. The person with the highest designation on the deck is expected to make the distribution. If the majority on the deck does not agree to the distribution proposed, the highest designation pirate will be thrown out of the ship (or simply killed). The first priority of the pirates is to stay alive and second to maximize the gold they get. Pirate 5 devises a plan which he knows will be accepted for sure and will maximize his gold. What is his plan?
To understand the answer,we need to reduce this problem to only 2 pirates. So what happens if there are only 2 pirates. Pirate 2 can easily propose that he gets all the 100 gold coins. Since he constitutes 50% of the pirates, the proposal has to be accepted leaving Pirate 1 with nothing. Now let’s look at 3 pirates situation, Pirate 3 knows that if his proposal does not get accepted, then pirate 2 will get all the gold and pirate 1 will get nothing. So he decides to bribe pirate 1 with one gold coin. Pirate 1 knows that one gold coin is better than nothing so he has to back pirate 3. Pirate 3 proposes {pirate 1, pirate 2, pirate 3} {1, 0, 99}. Since pirate 1 and 3 will vote for it, it will be accepted. If there are 4 pirates, pirate 4 needs to get one more pirate to vote for his proposal. Pirate 4 realizes that if he dies, pirate 2 will get nothing (according to the proposal with 3 pirates) so he can easily bribe pirate 2 with one gold coin to get his vote. So the distribution will be {0, 1, 0, 99}. Smart right? Now can you figure out the distribution with 5 pirates? Let’s see. Pirate 5 needs 2 votes and he knows that if he dies, pirate 1 and 3 will get nothing. He can easily bribe pirates 1 and 3 with one gold coin each to get their vote. In the end, he proposes {1, 0, 1, 0, 98}. This proposal will get accepted and provide the maximum amount of gold to pirate 5.
91.04 %
47 votes

logicshort

The Missing Servant

A king has 100 identical servants, each with a different rank between 1 and 100. At the end of each day, each servant comes into the king's quarters, one-by-one, in a random order, and announces his rank to let the king know that he is done working for the day. For example, servant 14 comes in and says "Servant 14, reporting in." One day, the king's aide comes in and tells the king that one of the servants is missing, though he isn't sure which one. Before the other servants begin reporting in for the night, the king asks for a piece of paper to write on to help him figure out which servant is missing. Unfortunately, all that's available is a very small piece that can only hold one number at a time. The king is free to erase what he writes and write something new as many times as he likes, but he can only have one number written down at a time. The king's memory is bad and he won't be able to remember all the exact numbers as the servants report in, so he must use the paper to help him. How can he use the paper such that once the final servant has reported in, he'll know exactly which servant is missing?
When the first servant comes in, the king should write down his number. For each other servant that reports in, the king should add that servant's number to the current number written on the paper, and then write this new number on the paper. Once the final servant has reported in, the number on the paper should equal (1 + 2 + 3 + ... + 99 + 100) - MissingServantsNumber Since (1 + 2 + 3 + ... + 99 + 100) = 5050, we can rephrase this to say that the number on the paper should equal 5050 - MissingServantsNumber So to figure out the missing servant's number, the king simply needs to subtract the number written on his paper from 5050: MissingServantsNumber = 5050 - NumberWrittenOnThePaper
90.67 %
45 votes

logicshort

The sequence

1 11 21 1211 111221 312211 What is the next number in the sequence?
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.
90.63 %
26 votes