A Formal Proof of the Collatz Conjecture via Convergence to the Set T_k = (2^k - 1)/3

⚠️ Note : This version has been superseded.Please refer to Version 2 of this document, which includes a significantly strengthened and formalized proof.The current file (V1) remains available for reference but is no longer recommended for consultation. 👉 (You can access Version 2 using the “Other versions” link at the top right of this page.)

Publication Details

Journal: Zenodo (CERN European Organization for Nuclear Research)
Published: 2025-07-19
DOI: https://doi.org/10.5281/zenodo.16169005
Primary Topic: Benford’s Law and Fraud Detection
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

A Formal Proof of the Collatz Conjecture via Convergence to the Set T_k = (2^k - 1)/3

Jul 19, 2025

Zenodo (CERN European Organization for Nuclear Research)

Benford’s Law and Fraud Detection

article

A Formal Proof of the Collatz Conjecture via Convergence to the Set T_k = (2^k - 1)/3

July 19, 2025article en

Abstract

Zenodo (CERN European Organization for Nuclear Research)

Openalex Percentile: Top 47%

Benford’s Law and Fraud Detection

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Formal Proof of the Collatz Conjecture via Convergence to the Set T_k = (2^k - 1)/3 · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS