Division-Free Reverse Collatz Branching via Modulo-12 Clock Arithmetic and the 4–10 Junction Axis

This study investigates the structural dynamics of the Reverse Collatz Tree by mapping positive integers onto a finite 12-hour modular clock system (\(\mathbb{Z}/12\mathbb{Z}\)). While the forward Collatz map generates a single deterministic trajectory, its inverse relation yields a binary branching structure governed by two operations: linear doubling (\(2y\)) and conditional odd-predecessor generation (\((y-1)/3\)). By analyzing the congruence classes modulo 12, we demonstrate that valid odd-integer branches can exclusively originate from integers located at the 4 o'clock (\(y \equiv 4 \pmod{12}\)) and 10 o'clock (\(y \equiv 10 \pmod{12}\)) positions, which form a symmetric \(180^{\circ }\) junction axis (\(y \equiv 4 \pmod{6}\)). All remaining ten congruence classes act strictly as non-branching linear conduits under the \(2y\) operation. Furthermore, by eliminating multiples of 3, we map all recurring Collatz states onto a two-dimensional \(4 \times 2\) coordinate matrix (\(A–H\)), isolating the reverse odd-branching to a single matrix row (Cells \(E\) and \(F\)). This modular characterization eliminates unnecessary division checks across 83.3% of all integers (75% of active matrix states), offering a division-free sieving framework for analyzing Collatz convergence trees.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24321455
Primary Topic
Smarandache Functions and Recreational Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Division-Free Reverse Collatz Branching via Modulo-12 Clock Arithmetic and the 4–10 Junction Axis

Samet Sahin
3 links
Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
preprint

Division-Free Reverse Collatz Branching via Modulo-12 Clock Arithmetic and the 4–10 Junction Axis

Samet Sahin
preprint en

Abstract

This study investigates the structural dynamics of the Reverse Collatz Tree by mapping positive integers onto a finite 12-hour modular clock system (\(\mathbb{Z}/12\mathbb{Z}\)). While the forward Collatz map generates a single deterministic trajectory, its inverse relation yields a binary branching structure governed by two operations: linear doubling (\(2y\)) and conditional odd-predecessor generation (\((y-1)/3\)). By analyzing the congruence classes modulo 12, we demonstrate that valid odd-integer branches can exclusively originate from integers located at the 4 o'clock (\(y \equiv 4 \pmod{12}\)) and 10 o'clock (\(y \equiv 10 \pmod{12}\)) positions, which form a symmetric \(180^{\circ }\) junction axis (\(y \equiv 4 \pmod{6}\)). All remaining ten congruence classes act strictly as non-branching linear conduits under the \(2y\) operation. Furthermore, by eliminating multiples of 3, we map all recurring Collatz states onto a two-dimensional \(4 \times 2\) coordinate matrix (\(A–H\)), isolating the reverse odd-branching to a single matrix row (Cells \(E\) and \(F\)). This modular characterization eliminates unnecessary division checks across 83.3% of all integers (75% of active matrix states), offering a division-free sieving framework for analyzing Collatz convergence trees.

Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
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.

Laika access coming soon