Grimm's conjecture

Grimm's conjecture states that every finite sequence of consecutive composite integers can be assigned distinct prime divisors, one dividing each integer.

Connect

Prime divisor: A prime divisor of an integer is a prime number that divides it exactly. Each composite in the sequence must receive one of its prime divisors.
Prime number: A prime number is an integer greater than one with no positive divisors other than one and itself. Only primes may serve as the distinct divisors in the conjecture.
Paul Erdős: Paul Erdős was a Hungarian mathematician whose work shaped number theory and combinatorics. Erdős proposed Grimm's conjecture in a 1969 paper.
Prime-counting function: The prime-counting function π(x) counts the primes less than or equal to x. Prime distribution estimates can help bound available divisors in intervals.
Prime gaps: A prime gap is the difference between consecutive prime numbers. Large gaps and clustering influence how prime divisors are distributed across neighboring integers.
System of distinct representatives: A system of distinct representatives selects one element from each set, with no selected element repeated. The conjecture asks for distinct choices from the sets of prime divisors.
Composite number: A composite number is an integer greater than one that has a positive divisor other than one and itself. The conjecture concerns sequences made entirely of these integers.
Journal of the Australian Mathematical Society: The Journal of the Australian Mathematical Society is a peer-reviewed mathematics journal founded in 1959. Erdős's paper introducing the conjecture appeared in this journal.
Sieve theory: Sieve theory estimates or identifies integers that avoid specified prime divisors. Sieve estimates provide tools for studying primes among the divisors of nearby integers.
Combinatorial number theory: Combinatorial number theory applies counting and structural methods to problems about integers. The conjecture combines divisibility with a finite matching condition.