A thousand people stand in a circle in order from 1 to 1000. Number 1 has a sword. He kills the next person (Number 2) and gives the sword to the next living person (Number 3). All people keep doing the same until only one person remains. Which number survives?
Two friends, logicians – Ein and Stein – get imprisoned in two distant cells in a castle. Both cells have just one door, and a window with 8 bars in the first cell, and 12 bars in the second cell. The first day both logicians get the same letter from the prison master:
“The total number of bars in the two prison cells in this castle is either 18 or 20. Starting tomorrow, every morning I will go first to Ein and then to Stein, and will ask how many bars the other logician has. If one of you answers correctly, I will immediately let both of you leave the castle. If one of you answers incorrectly, I will execute both of you. Of course, you can always decide not to answer and just stay imprisoned. I have sent a copy of this letter to you and your friend. There is no point in trying to communicate with him – your cells are far away from each other, and he won’t hear you.”
Will the logicians manage to escape the castle eventually? When will they do it?
You are lost in the middle of a forest, and you know there is a straight road exactly 1 km away from you, but not in which direction. Can you find a path of distance less than 640 m which will guarantee you to find the road?
Imagine there is a circle with a radius of 100 m around you, and you are at its center O. Let the tangent to the circle directly ahead of you be t. Then, follow the path:
Turn left 30 degrees and keep walking until you reach the tangent t at point A for a total of 100×2√3/3 meters, which is less than 115.5 meters.
Turn left 120 degrees and keep walking along the tangent to the circle until you reach the circle at point B for a total of 100×√3/3 which is less than 58 meters.
Keep walking around the circle along an arc of 210 degrees until you reach point C for a total of 100×7π/6 which is less than 366.5 meters.
Keep walking straight for 100 meters until you reach point D on the tangent t.
There are N points on a circle. If we draw all the chords connecting these points and no three of them intersect at the same point, in how many parts will the interior of the circle get broken?
For example, when N is equal to 1, 2, 3, 4, and 5, we get 1, 2, 4, 8, and 16 parts respectively.
The answer, somewhat surprisingly, is not 2ᴺ⁻¹, but 1 + N(N-1)/2 + N(N-1)(N-2)(N-3)/24.
In order to see that, we start with a single sector, the interior of the circle, and keep successively drawing chords. Every time we draw a new chord, we increase the number of parts by 1 and then add 1 extra part for each intersection with previously drawn chords.
Therefore, the total number of parts at the end will be:
1 + the number of the chords + the number of the intersections of the chords
Each chord is determined by its 2 endpoints and therefore the number of chords is N(N-1)/2.
Each intersection is determined by the 4 endpoints of the two intersecting chords and therefore the number of intersections is N(N-1)(N-2)(N-3)/4!.
Left alone, I’m a word with five letters. I’m honest and fair, I’ll admit. Rearranged, I’m of no use to trains. Again, and I’m an overt place, warm and well lit.
What am I?
The answer is LIAR. After rearranging the letters, you can get RAIL – important for trains, or LAIR – a dark, hidden place. Since the riddler is a liar, the resulting words are exactly the opposite of his descriptions.
Tango and Cash are playing the following game: Each of them chooses a number between 1 and 9 without replacement. The first one to get 3 numbers that sum up to 15 wins. Does any of them have a winning strategy?
Place the numbers from 1 to 9 in a 3×3 grid so that they form a magic square. Now the game comes down to a standard TIC-TAC-TOE, and it is well-known that it always leads to a draw when both players use optimal strategies.
David Copperfield and his assistant perform the following magic trick. The assistant offers a person from the audience to pick 5 arbitrary cards from a regular deck and then hands them back to him. After the assistant sees the cards, he returns one of them to the audience member and gives the rest one by one to David Copperfield. After the magician receives the fourth card, he correctly guesses what card the audience member holds in his hand. How did they perform the trick?
Out of the five cards, there will be (at least) two of the same suit; assume they are clubs. Now imagine all clubs are arranged in a circle in a cyclic manner – A, 2, 3, … J, Q, K (clock-wise), and locate the two chosen ones on it. There are two arks on the circle which are connecting them and exactly one of them will contain X cards, with X between 0 and 5. Now the assistant will pass to David Copperfield first the clubs card which is located on the left end of this ark, will return to the audience member the clubs card which is located on the right end of it and, with the remaining three cards, will encode the number X. In order to do this, he will arrange the three extra cards in increasing order – first clubs A-K, then diamonds A-K, then hearts A-K and finally spades A-K. Let us call the smallest card in this order “1”, the middle one “2” and the largest one “3”. Now, depending on the value of X, the assistant will pass the cards “1”, “2” and “3” in the following order:
In this way David Copperfield will know the suit of the audience member’s card and also with what number he should increase the card he received first in order to get value as well. Therefore, he will be able to guess correctly.
You encounter three Gods in a room – the God of Truth, the God of Lie and the God of Uncertainty. You don’t know which one is which, but know that the God of Truth always says the truth, the God of Lie always says the lie and the God of Uncertainty sometimes lies and sometimes says the truth. You can ask in succession each of the Gods a unique question, to which they can reply only with “Yes” or “No”. However, their responses will be in their native language – “Da” or “Ne”, and you don’t know which translation to which answer corresponds. Your task is to figure out what questions to ask the Gods, so that will recognize which one of them is the God of Truth, which one is the God of Lie and which one is the God of Uncertainty.
Label the gods with numbers – 1, 2, and 3.
First, ask god 1 “If I ask you whether god 2 is random, would you say ‘Da’?”. If he responds “Da”, then god 3 is not the god of uncertainty. If he responds “Ne”, then god 2 is not the god of uncertainty. In both cases we will be able to find a god which is not the god of uncertainty, let without of generality that is god 3.
Next, ask god 3 “If I ask you whether you are the God of Lie, would you say ‘Da’?”. If he says “Da”, then he is the God of Truth. If he says “No”, then he is the God of Lie.
Finally, ask god 3 whether god 1 is the God of Uncertainty and conclude the identities of all gods.