arXiv (All)
open access
Collatz conjecture becomes theorem
The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any elementary number theory completes the main result.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Decidability of Numbers: Chaitin's Omega and Prime Numbers#81290
- Logika opravdanja u Boškovićevoj indukciji [Justification Logic in Bošković's Induction]#87759
- Advanced topics in computational number theory#490244
- Probabilistic algorithm for testing primality#490237
- Products of consecutive integers with unusual anatomy#1117352
Record · ID 821646
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive