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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT, Claude Opus, Codex Discussed: 0 Published: 2026-11-20 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 Page: https://delphi.science/r/hexagon/2611.00694 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…