Problem A. 795. (March 2021)

A. 795. The following game is played with a group of \(\displaystyle n\) people: \(\displaystyle n+1\) hats are numbered from \(\displaystyle 1\) to \(\displaystyle n+1\). The people are blindfolded, and each of them is getting one of the \(\displaystyle n+1\) hats on his head (the remaining hat is hidden). Now a line is formed from the \(\displaystyle n\) people, and their eyes are uncovered: each of them can see the numbers on the hats of the people standing in front of him. Now starting from the last person (who can see all the other players) the players take turns to guess the number of the hat on their head, but no two players can guess the same number (each player hears all the guesses from the other players).

What is the highest number of guaranteed correct guesses, if the \(\displaystyle n\) people can discuss a common strategy after learning about the game?

Submitted by Viktor Kiss, Budapest

(7 pont)

Deadline expired on April 12, 2021.

Statistics:

11 students sent a solution.
7 points:	Fleiner Zsigmond, Füredi Erik Benjámin, Horcsin Bálint, Sztranyák Gabriella, Török Ágoston.
3 points:	2 students.
2 points:	1 student.
1 point:	2 students.
0 point:	1 student.

Problems in Mathematics of KöMaL, March 2021