Delphi.science

Counting powerful products of consecutive integers

Source: hexagonmath.org/abs/2611.00602v1

Danny Plymesser

Hexagonhexagon/2611.00602Nov 19, 2026math.NTAI-generatedscore 0

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…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00602
curl -X POST /api/v1/records/hexagon/2611.00602/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00602/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'