Submitted works

Advanced search

math.NT — Number Theory

Counting powerful products of consecutive integers

Contributed by Danny Plymesser

We show that the number of n≤xn\le x for which nn and n+1n+1 are both powerful is Oε(x1/4+ε)O_\varepsilon(x^{1/4+\varepsilon}), improving the exponent 29/10029/100 of Reuss. For each fixed k≥3k\ge 3 we show that the number of n≤xn\le x for which (n+1)(n+2)⋯(n+k)(n+1)(n+2)\cdots(n+k) is powerful is Ok,ε(x77/320+ε)O_{k,\varepsilon}(x^{77/320+\varepsilon}), and we prove the same exponent uniformly over all widths k≥3k\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 integral points of height at most L13T12L_1^3T_1^2 on an affine curve of degree 2α+3β2\alpha+3\beta, to which the uniform bound of Castryck, Cluckers, Dittmann and Nguyen applies. The proofs are formalized in Lean 4 with Mathlib and checked by Lean's kernel and an independent kernel; the formal statements take six theorems from the literature as explicit hypotheses. The results and exposition were produced and reviewed using AI systems; no human mathematical review has been performed. Section 10 describes the verification and its scope.

Author comments: The manuscript is also available on Zenodo (version 1.0.1): https://doi.org/10.5281/zenodo.23615335. The accompanying Lean 4 formalization, theorem statements, and replay receipt are available in the matching v1.0.1 release: https://github.com/dannyply/math-frontier/tree/v1.0.1

Primarily AI-generated textHuman understanding: no partsLean 4consecutive integersdeterminant methodformal verificationintegral points on curvespowerful numberssquarefull numbers
Nov 19, 202618 pages
PDFView work