My new paper:
This paper discusses the following elementary mathematics problem:
You are given 101 coins such that after removal of any one of them the remaining coins can be redistributed in two groups of 50 coins in such a way that the sum of values of coins in each group is the same. Prove that all coins have equal values.
It has an elementary solution, but also happens to be surprisingly deep.