An approach to the Syracuse conjecture v. 2

I propose a new approach to the Syracuse conjecture by introducing a tree structure T which integrates all the natural integers. This construc- tion makes it possible to show that any number necessarily follows a path leading to 1 and can be an interesting way of validating the conjecture. In addition, to reinforce the main argument of the paper, namely that the T-Tree can be used to prove Syracuse’s conjecture, I will introduce a first appendix that will provide a concrete visualisation of the distribution of Buds in the Tree. It will show how the mathematical rules defined in the previous sections translate into an organised structure that includes all odd integers. I will introduce the concept of Arborescent Number in Appendix 2 then, in Appendix 3, I will provide a python code that NEW : Finally, in Appendix 4, I will try to prove by recurrence that every positive odd number is a bud of T

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-10
DOI
https://doi.org/10.5281/zenodo.15001420
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

An approach to the Syracuse conjecture v. 2

Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
article

An approach to the Syracuse conjecture v. 2

article en

Abstract

I propose a new approach to the Syracuse conjecture by introducing a tree structure T which integrates all the natural integers. This construc- tion makes it possible to show that any number necessarily follows a path leading to 1 and can be an interesting way of validating the conjecture. In addition, to reinforce the main argument of the paper, namely that the T-Tree can be used to prove Syracuse’s conjecture, I will introduce a first appendix that will provide a concrete visualisation of the distribution of Buds in the Tree. It will show how the mathematical rules defined in the previous sections translate into an organised structure that includes all odd integers. I will introduce the concept of Arborescent Number in Appendix 2 then, in Appendix 3, I will provide a python code that NEW : Finally, in Appendix 4, I will try to prove by recurrence that every positive odd number is a bud of T

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 61%
Benford’s Law and Fraud Detection
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.