The YouTube video The Riddle That Seems Impossible Even If You Know The Answer describes an interesting mathematical problem as well as its solution. Briefly, the problem is as follows:
In a prison, there are 100 prisoners labelled from 1 to 100. In a room within the prison, there are 100 boxes labelled from 1 to 100 on the outside. Inside each box is also labelled from 1 to 100, with the number inside the box being generally unrelated to the number outside the box. All the prisoners go into the room one at a time to try to identify the box containing their own number on the inside. Each prisoner is allowed to look in no more than 50 boxes. If every prisoner finds his own number, then all the prisoners will be freed. But if any prisoner fails to find his own number, then all the prisoners will be executed. Each prisoner must leave the room in the same state as it was before he entered the room. None of the prisoners can observe another prisoner’s search. Nor is any prisoner allowed to communicate with any of the other prisoners after he has completed his search. However, before any of the prisoners search, all of the prisoners are allowed to gather to formulate a search strategy. What should this search strategy be?