math.NT — Number Theory
Sharp finite cases of the Erdős–Surányi interval-product problem: g(4) = 5 and g(5) = 6
Let be the Erdős–Surányi function of Erdős Problem #708: the least such that, for every set of distinct integers at least and every interval of consecutive integers, some set of at most elements of has product divisible by . We prove and . The lower bound for is due to Erdős and Surányi (1959). Our contribution is the matching universal upper bounds and ; to our knowledge these are the first exact values beyond . The four-modulus proof combines a Hall-matching reduction with gcd/lcm collision repair and an anchored proper-divisor lemma. The five-modulus proof classifies a maximal antichain-admissible assignment of the moduli to interval multiples by its occupancy shape; the hardest shapes are a squarefree four-prime exception and a configuration controlled by a propagation invariant. Both values, in the exact-cardinality reading of the original problem and in the at-most reading used by later work, are machine-checked in Lean 4. The formalization is registered in the Palomar registry as PALOMAR-2026-11-19-000019. The general question whether remains open.