We will discuss an interesting problem described as such:
- A hundred prisoners are offered a deal.
- Their names are placed into 100 jars, and if each prisoner can find
their own name, they go free.
- The catch: They go one at a time, and cannot change the jars or
communicate after their turn.
- And each prisoner is only allowed to look in 50 jars.
We hope to see you all there!
