PROTOTYPE (v1.0). Collected volume and data deposit on consecutive powerful numbers, Pell equations, and Erdős problems #364 and #365. A reworked international version follows.
-
Updated
Oct 4, 2026 - HTML
PROTOTYPE (v1.0). Collected volume and data deposit on consecutive powerful numbers, Pell equations, and Erdős problems #364 and #365. A reworked international version follows.
No three consecutive powerful numbers around a cube with mixed prime factorizations — paper + complete verification scripts (SymPy/SageMath). Preprint on Zenodo.
Kernel-certified verification of Erdős problem 364 (three consecutive powerful numbers) to 10^14, with axioms limited to propext, Classical.choice and Quot.sound.
To associate your repository with the powerful-numbers topic, visit your repo's landing page and select "manage topics."