onstructive proof of the Catalan Conjecture (Mihăilescu's Theorem)
-
Updated
Jun 16, 2025 - TeX
onstructive proof of the Catalan Conjecture (Mihăilescu's Theorem)
構成的素数構造(6n±1)と除去関数により、Goldbach予想・Bertrand仮説・Catalan予想を共通基盤から再構成。非構成的証明とも形式整合し、論理強度と実行再現性の両立を実現。GitHubにて統合証明パッケージとして公開。 Using the 6n±1 prime structure and composite exclusion, we reconstruct and unify constructive proofs of Goldbach, Bertrand, and Catalan conjectures, demonstrating formal alignment with classical non-constructive methods.
Add a description, image, and links to the catalan-conjecture topic page so that developers can more easily learn about it.
To associate your repository with the catalan-conjecture topic, visit your repo's landing page and select "manage topics."