This post is based on a Linfoot talk by Shanta Laishram.

**Grimm’s conjecture.** Let be consecutive composite numbers. Then there exist distinct primes such that for .

Amazingly, this simple conjecture was not published until 1969. It has been verified for . The calculations were economised through an argument beginning with Hall’s marriage theorem.

**Grimm’s function. **Let be the largest integer such that distinct prime divisors exist for .

Henceforth, let denote the th smallest prime. Then Grimm’s conjecture is equivalent to the statement that for all . It is this relationship to the prime gap that makes Grimm’s conjecture not only interesting but significant. Indeed, assuming Grimm’s conjecture, upper bounds on Grimm’s function are upper bounds for the prime gap.

Henceforth, we consider the prime gap for large . The best unconditional prime gap (for large ) is , due to Baker, Harman and Pintz. The Riemann hypothesis implies the prime gap bound . This is due to Harald Cramér, who conjectured the bound .

Incredibly, the current conditional result based on Grimm’s conjecture *beats* the RH one! This follows immediately from recent work of Laishram and Ram Murty based on smooth numbers and the Selberg sieve.

**Theorem (Laishram and Ram Murty, 2012). **There exists such that if then

.

Thus Grimm’s conjecture also implies Legendre’s conjecture asymptotically. I’d be interested to know if the can be made explicit in the above Theorem.