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 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 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00602 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…