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.
-
Updated
Aug 2, 2026 - Lean
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.
No three consecutive powerful numbers around a cube with mixed prime factorizations — paper + complete verification scripts (SymPy/SageMath). Preprint on Zenodo.
Add a description, image, and links to the powerful-numbers topic page so that developers can more easily learn about it.
To associate your repository with the powerful-numbers topic, visit your repo's landing page and select "manage topics."