Counting powerful products of consecutive integers

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Danny Plymesser ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

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

Provenance statement

The author chose the problem, set the objectives, operated the Jocelyn research harness, selected the manuscript content and commissioned the reviews. AI agents produced the results, written and formal proofs, computation scripts and manuscript text. AI coding assistants also assisted with revision and review. The Lean 4 formalization uses Mathlib and was checked with Lean’s kernel and the independent kernel Nanoda. Six results from the literature enter as explicit hypotheses. The manuscript reports no human mathematical review.

Tools used

Lean
Lean
OpenAI
Codex
Anthropic
Claude Opus
Anthropic
Claude Fable
Anthropic
Claude Sonnet

References

  1. K. Aktaş and M. R. Murty, Fundamental units and consecutive squarefull numbers , Int. J. Number Theory 13 (2017), 243--252.
  2. T. F. Bloom, Erdős problems , https://www.erdosproblems.com, Problems #137, #364, #365.link
  3. E. Bombieri and W. Gubler, Heights in Diophantine Geometry , Cambridge University Press, 2006.
  4. W. Castryck, R. Cluckers, P. Dittmann and K. H. Nguyen, The dimension growth conjecture, polynomial in the degree and without logarithmic factors , Algebra Number Theory 14 (2020), 2261--2294; arXiv:1904.13109.arXiv
  5. T. H. Chan, Twin squareful numbers , J. Aust. Math. Soc. 93 (2012), 43--51.
  6. P. Erdős, Problems and results on number theoretic properties of consecutive integers and related questions , in: Proc. Fifth Manitoba Conf. Numer. Math. (1975), 1976, 25--44.
  7. P. Erdős, Problems and results on consecutive integers , Publ. Math. Debrecen 23 (1976), 272--282.
  8. P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory , Monographies de L'Enseignement Mathématique 28 , Geneva, 1980.
  9. P. Erdős and J. L. Selfridge, The product of consecutive integers is never a power , Illinois J. Math. 19 (1975), 292--301.
  10. S. W. Golomb, Powerful numbers , Amer. Math. Monthly 77 (1970), 848--852.
Show all 19 referencesShow fewer references
  1. D. R. Heath-Brown, The density of rational points on curves and surfaces , Ann. of Math. (2) 155 (2002), 553--595.
  2. D. R. Heath-Brown, Counting rational points on algebraic varieties , in: Analytic Number Theory (C.I.M.E. Summer School, Cetraro, 2002), Lecture Notes in Math. 1891 , Springer, 2006, 51--95; author's manuscript: Oxford Mathematical Institute eprint 676.
  3. D. R. Heath-Brown, Square-free values of n2+1n^2+1 , Acta Arith. 155 (2012), 1--13; arXiv:1010.6217.arXiv
  4. Thomas Reuss, Pairs of kk-free numbers, consecutive square-full numbers , arXiv:1212.3150v2 (2014).arXiv
  5. Thomas Reuss, The Determinant Method and Applications , DPhil thesis, University of Oxford, 2015.
  6. C. L. Stewart, On the number of solutions of polynomial congruences and Thue equations , J. Amer. Math. Soc. 4 (1991), 793--835.
  7. T. Tao, Products of consecutive integers with unusual anatomy , arXiv:2603.27990v3 (2026).arXiv
  8. D. T. Walker, Consecutive integer pairs of powerful numbers and related Diophantine equations , Fibonacci Quart. 14 (1976), 111--116.
  9. W. Wongcharoenbhorn and Y. Meemark, Square-full values of quadratic polynomials , Bull. Aust. Math. Soc. 113 (2026), 40--54; arXiv:2405.06968.arXiv

Version history

  1. v1 · 18 pagesSubmitted by Danny PlymesserThe 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.1CurrentNov 18, 2026