Students with Hats

Professor Vivek decided to test three of his students, Frank, Gary and Henry. The teacher took three hats, wrote on each hat a positive integer, and put the hats on the heads of the students. Each student could see the numbers written on the hats of the other two students but not the number written on his own hat.

The teacher said that one of the numbers is sum of the other two and started asking the students:

— Frank, do you know the number on your hat?
— No, I don’t.
— Gary, do you know the number on your hat?
— No, I don’t.
— Henry, do you know the number on your hat?
— Yes, my number is 5.

What were the numbers which the teacher wrote on the hats?

The numbers are 2, 3, and 5. First, we check that these numbers work.

Indeed, Frank would not be able to figure out whether his number is 2 or 8. Then, Gary would not be able to figure out whether his number is 3 or 7, since with numbers 2, 7, 5, Frank still would not have been able to figure his number out. Finally, Henry can conclude that his number is 5, because if it was 1, then Gary would have been able to conclude that his number is 3, due to Frank’s inability to figure his number out.

Next, we we check that there are no other solutions. We note that if the numbers are 1, 4, 3, or 3, 2, 1, or 4, 1, 3, neither Frank nor Gary would have been able to figure their number out. Therefore, if the numbers were 1, 4, 5, or 3, 2, 5, or 4, 1, 5, Henry would not have been able to figure his number out. Thus, 5 is not the largest number.

Similarly, if the numbers are X, X + 5, X + 10, or X + 5, X, X + 10, once again, neither Frank nor Gary would have been able to figure their number out. Therefore, if the numbers were X, X + 5, 5, or X + 5, X, 5, Henry would not have been able to figure his number out.

Parable of the Polygons

Parable of the Polygons is an interesting analysis of diversity in society, beautifully presented through a series of puzzles, simulations, and many, many colorful squares and triangles. This project, created by Vi Hart and Nicky Case, is short, but very insightful and entertaining. Make sure to check it out by clicking the image below.

The Ping Pong Puzzle

Three friends – A, B, and C, are playing ping pong. They play the usual way – two play at a time, the winner stays on the table, the loser lets the third one play. If you know that A played 10 matches in total, B played 15 matches in total, and C played 17 matches in total, who lost the second game?

A lost it. Since there have been (10 + 15 + 17) / 2 = 21 games played in total, and each player never misses 2 games in a row, the only way for A to play just 10 games is if he plays the 2nd, 4th, 6th, etc. games, and every time loses.

The Troll Brothers

There are four troll brothers – Wudhor, Xhaqan, Yijlob, and Zrowag.

  • Wudhor always says the truth.
  • Xhaqan always lies.
  • Yijlob lies or says the truth unpredictably.
  • Zrowag is deaf and never answers.

You must ask these brothers four YES/NO questions (one troll per question), and figure out their names. What questions would you ask?

Coming soon.

Source:

Puzzling StackExchange