Bertrand's Postulate was a potential project topic, but nobody ended up choosing it. This postulate is actually an interesting statement regarding the distribution of primes. It says the following: For any integer n>3, there exists a prime p such that n < p< 2n-2.

This postulate is also referred to as the "Bertrand-Chebyshev Theorem" because Chebyshev was the one who actually proved that this holds for all integers greater than 3. Bertrand was able to prove that the postulate holds for the interval [2, 3,000,000]

Later on, it was found that for all n>24, there will always be a prime p such that n < p < 6n/5. Obviously, this is a lot more specific than the original postulate.

For more information on Bertrand's Postulate, I recommend checking out the following link:

http://en.wikipedia.org/wiki/Bertrand%27s_postulate