Can you prove that there are arbitrarily many primes in arbitrarily big intervals?
In this problem you have to devise a strategy to beat the computer in a "guess the polynomial" game.
This simple problem is an example of a very interesting phenomenon: if you have a large enough "universe" to consider, even randomly picked parts exhibit structured properties.
Split the numbers 0, 1, ..., 15 into two sets with sum interesting properties!
Two friends were bored and decided to play a game... a mathematical game with a paper bag!
