Powerful values of quadratic polynomials
A number is powerful if every prime that divides it divides it at least twice. This paper bounds how often quadratic polynomials take powerful values. For a fixed integer quadratic with positive leading coefficient and nonsquare discriminant, the bound is O(N^(293/1220+ε)). A second bound has exponent 389/1600 and polynomial dependence on the coefficients, with applications to neighbouring powerful and higher-power-full integers. The argument extends the framework of Counting powerful products of consecutive integers. The main quadratic and mixed-full bounds are formalized in Lean 4 and independently kernel-checked, with three literature theorems entering as explicit hypotheses. The results, proofs and text were produced with AI systems.
Authors
- Danny Plymesser
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24292370
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint