Related papers: Two remarks on the Collatz cycle conjecture
Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…
The Collatz and $abc$ conjectures, both well known and thoroughly studied, appear to be largely unrelated at first sight. We show that assuming the $abc$ conjecture true is helpful to improve the lower bound of integers initiating a…
The Collatz conjecture states that repeated steps of $n\mathrm{\to }\mathrm{3}n\mathrm{+1}$ at odd numbers and $n\mathrm{\to }n\mathrm{/2}$ at even numbers amount to walks over root paths to the branching number $c=4$ in the `trivial'…
We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.
We introduce an explicit logarithmic transformation $T(x) = \{\log_6(x + 1/5)\}$ under which the Collatz map becomes a rigid circle rotation by the irrational angle \(\alpha = \log_6 3\), perturbed by a uniformly bounded error term. We…
The acyclic system conjecture of Ardila and Ceballos can be interpreted as saying the following: "Every triangulation of the 3-skeleton of a product of two simplices can be extended to a triangulation of the whole product". We show a…
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…
A recast of the standard residue-class analysis of the 3x+1 (Collatz) map in terms of two elementary operators on arithmetic progressions. The resulting calculus (i) splits any progression into its even and odd subsequences in a single…
The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…
Professor Cadogan at the University of the West Indies identified special starting points that yield long subsequences where the normalization constant, k, is always one. I studied these special sequences and found an implicit mixed integer…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…
The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of…
We here elaborate on a quantitative argument to support the validity of the Collatz conjecture, also known as the (3x + 1) or Syracuse conjecture. The analysis is structured as follows. First, three distinct fixed points are found for the…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.
The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…
This article presents a variety of algebraic proofs of Steiner's $1$-Cycle Theorem. It also demonstrates that, under an exponential upper-bound on the iterates, the only $1$-cycles in the (accelerated) $3x-1$ dynamical system are $(1)$ and…