Related papers: On the nonexistence of cycles for the Collatz func…
In this research, an optimal algorithm for the Collatz conjecture is presented. Properties such as the convergence of the algorithm and an equation that relates the algorithm to the classical Collatz conjecture are obtained. It is validated…
The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single…
Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…
This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function.…
This paper is a numerical evaluation of some trajectories of the Collatz function. Specifically, I assess the coalescence points of each integer $n\equiv 0 (\bmod{2})$ and $n\equiv 2(\bmod{3})$ through a sophisticated algorithm that has…
In this paper, we show that if the numbers in the range $[1,2^n]$ satisfy Collatz conjecture, then almost all integers in the range $[2^n+1,2^{n+1}]$ will satisfy the conjecture as $n \to \infty$. The previous statement is equivalent to…
We characterize all bounded orbits of two similar Collatz-type quadratic mappings of the set of non-negative integers. In one case, where cycles of all possible lengths may occur, an orbit is bounded if and only if it reaches a cycle. For…
In 2017, Michael Cuntz gave a definition of reducibility of quiddity cycles of frieze patterns: It is reducible if it can be written as a sum of two other quiddity cycles. We discuss the commutativity and associativity of this sum operator…
This paper explores special conditions on the starting value of a Collatz sequence which imply that the Collatz conjecture is true. This is the result of the collaboration of a retired mathematics professor (Koelzer) and a retired physics…
The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…
We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We…
The scope of the present work is to explain why it is true that all N have a distinct position in The Collatz Tree (The Collatz Graph)
We establish an equivalent condition to the validity of the Collatz conjecture, using elementary methods. We derive some conclusions and show several examples of our results. We also offer a variety of exercises, problems and conjectures.
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…
We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.
In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.
This paper studies certain trajectories of the Collatz function. I show that if for each odd number $n$, $n\sim 3n+2$ then every positive integer $n \in \mathbb{N}\setminus 2^{\mathbb{N}}$ has the representation…
The Collatz problem is related to the fixed point problem, and is widely used in mathematics. It has attracted a wide range of math enthusiasts, but is still difficult to solve. So, this article aimed to study the extension of the Collatz…
We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by…
We obtain a complete characterization of all orbits of a quadratic Collatz-type recursion called the divide-or-choose-2 rule. Each orbit either ends in a cycle whose period depends on the initial value or it goes to infinity. We specify…