Exact Small-𝑛 Values (𝑔(4) = 5, 𝑔(5) = 6, 𝑔(6) = 8) and Constructive Lower Bounds (𝑔(7) ≥ 9, 𝑔(8) ≥ 11) for Erdős Problem 708
Year: 2026
Type: preprint
Abstract: Let A be a set of n integers greater than or equal to 2 with maximum M. Let g(n) be the smallest integer such that every interval I of length M contains a subset B of size at most g(n) whose product is divisible by the product of all elements in A. Erdős and Surányi proved that g(n) is at least (2 - o(1))n in 1959. Erdős later posed the question of whether g(n) <= (2 + o(1))n. Existing methods, such as those by Chen, established upper bounds of g(n) <= 12n. These methods struggle in the intermediate interval regime. We resolve this by combining interval-splitting, divisor-closure, and universal cumulative-GCD bounds. We prove that g(4) = 5, g(5) = 6, and g(6) = 8. We also construct Chinese Remainder Theorem witnesses showing that g(7) >= 9 and g(8) >= 11. In other words, our method closes the gap for small n and provides a constructive approach to the asymptotic problem. For the case where n = 6, a finite certificate covers the range up to M = 3,481. Slot-packing reductions close the remaining cases for larger M. For the general asymptotic theory and further context, see the companion manuscript: [10.5281/zenodo.24342718](https://doi.org/10.5281/zenodo.24342718).
Author: Bergström, C.
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236659126
