Sharp finite cases of the Erdős–Surányi interval-product problem: g(4) = 5 and g(5) = 6
Source: hexagonmath.org/abs/2611.00694v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00694
curl -X POST /api/v1/records/hexagon/2611.00694/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00694/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'