math.NT — Number Theory
Counting powerful products of consecutive integers
We show that the number of for which and are both powerful is , improving the exponent of Reuss. For each fixed we show that the number of for which is powerful is , and we prove the same exponent uniformly over all widths . 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 become integral points of height at most on an affine curve of degree , 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.