Skip to content
#

constructive-proof

Here are 11 public repositories matching this topic...

This repository presents a constructive and non-constructive unified proof of the Ramanujan prime theorem using 6n±1-based prime generation and density analysis. 構成的AIが6n±1型の素数構成と分布密度の評価を通じて、ラマヌジャン素数の定理性を統合的に導出。仮想空間検証済みの証明構成を含みます。

  • Updated Jul 2, 2025
  • TeX

This repository presents a constructive and complete proof of the P≠NP problem, based on structural separation and recursive unconstructibility. 本リポジトリは、構成的手法によりP≠NP問題を完全に証明した理論を収録しています。構成不能性と分離構造に基づく新たなアプローチです。

  • Updated Jun 22, 2025

All even perfect numbers are constructively classified using the Euclid–Euler formula. Non-constructive elimination confirms no other forms exist. すべての偶数完全数は Euclid–Euler の公式により構成的に分類され、形式外の完全数は非構成的に否定される。

  • Updated Jul 2, 2025
  • Python

Unified constructive and non-constructive proofs of three number theory problems: Twin Prime, Collatz, and the Prime Number Theorem. Based on 6n±1 primes and composite removal, with density-based complements. 双子素数予想・コラッツ予想・素数定理を構成的+非構成的に統合。6n±1型素数構成と除去関数、密度補完による論理統合。

  • Updated Jul 2, 2025

構成的素数構造(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.

  • Updated Jul 2, 2025
  • Python

Improve this page

Add a description, image, and links to the constructive-proof topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the constructive-proof topic, visit your repo's landing page and select "manage topics."

Learn more