When preparing for the number theory exam, I studied the Bertrand-Chebyshev theorem and was fascinated by its guarantee that there is at least one prime between n and 2n for every n>1.