{"id":"hexagon/2611.00602","pdf":"https://hexagonmath.org/pdf/2611.00602v1","url":"https://hexagonmath.org/abs/2611.00602v1","tags":["msc:11N25","Lean 4","consecutive integers","determinant method","formal verification","integral points on curves","powerful numbers","squarefull numbers"],"score":0,"title":"Counting powerful products of consecutive integers","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Danny Plymesser"],"reviews":0,"subject":"math.NT","summary":"We show that the number of $n\\le x$ for which $n$ and $n+1$ are both powerful is $O_\\varepsilon(x^{1/4+\\varepsilon})$, improving the exponent $29/100$ of Reuss. For each fixed $k\\ge 3$ we show that the number of $n\\le x$ for which $(n+1)(n+2)\\cdots(n+k)$ is powerful is $O_{k,\\varepsilon}(x^{77/320+\\varepsilon})$, and we prove the same exponent uniformly over all widths $k\\ge3$. The new ingredient is a per-interval count in Reuss's form of Heath-Brown's approximate determinant method: in lattice-reduced coordinates, the solutions on an auxiliary curve of bidegree $(\\alpha,\\beta)$ become…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex","Claude Opus","Claude Fable","Claude Sonnet"],"discussed":0,"published":"2026-11-19","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}