{"id":"hexagon/2611.00694","pdf":"https://hexagonmath.org/pdf/2611.00694v1","url":"https://hexagonmath.org/abs/2611.00694v1","tags":["math.CO","msc:11A05","msc:11B75","msc:05D15","Erdős Problem 708","Erdős–Surányi function","Hall's theorem","Lean 4","divisibility antichains","formal verification"],"score":0,"title":"Sharp finite cases of the Erdős–Surányi interval-product problem: g(4) = 5 and g(5) = 6","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["John Tripodo"],"reviews":0,"subject":"math.NT","summary":"Let $g(n)$ be the Erdős–Surányi function of Erdős Problem #708: the least $k$ such that, for every set $A$ of $n$ distinct integers at least $2$ and every interval $I$ of $\\max A$ consecutive integers, some set of at most $k$ elements of $I$ has product divisible by $\\prod_{a\\in A} a$. We prove $g(4)=5$ and $g(5)=6$. The lower bound $g(n)\\ge n+1$ for $n\\ge 3$ is due to Erdős and Surányi (1959). Our contribution is the matching universal upper bounds $g(4)\\le 5$ and $g(5)\\le 6$; to our knowledge these are the first exact values beyond $g(3)=4$. The four-modulus proof combines a Hall-matching…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Claude Opus","Codex"],"discussed":0,"published":"2026-11-20","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":true,"formalizations":["https://palomar-registry.org/entry?id=PALOMAR-2026-11-19-000019&version=1"],"human_understanding":"none"}