Related papers: On the nonexistence of cycles for the Collatz func…
For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…
An operational approach to the Collatz Conjecture is presented. Scenarios are defined as strings of characters "s" (for "spike") and "d" (for "down") which symbolize the Collatz operations (3m+1)/2 and m/2 in a Collatz Series connecting two…
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…
In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…
The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…
In this work the generalized Collatz problem $qn+1$ ($q$ odd) is studied. As a natural generalization of the original $3n+1$ problem, it consists of a discrete dynamical system of an arithmetical kind. Using standard methods of number…
Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…
In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…
Taking a new approach towards analyzing the Collatz Problem, or, 3x+1 conjecture. Introducing some new functions, the Collatz-2 and Collatz-3 sequences, as well as deducing results related to Collatz-2 and Collatz-3 sequences.
Halbeisen and Hungerbuhler determined optimal bounds for the length of rational Collatz cycles. Their methods are extended to $3n+c$ cycles. Another sequence having properties similar to those of Riemann zeta function zeros is introduced.
By using properties of Markov homogeneous chains and Banach measure in $\mathrm{N}$, it is proved that a relative frequency of even numbers in the sequence of $n$-th coordinates of all Collatz sequences is equal to the number…
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…
We analyze the stopping-time and cycle structure of the normalized Collatz iteration. Using a recursive description of admissible binary sequences, we show that every integer $m \equiv 3 \pmod{4}$ arises uniquely and derive new bounds for…
As Collatz conjecture is still to be proved, a method to arrive at the complete proof is explored here. Conceptually, the process relies on the pre-proven sequence data and the method follows the confirmation of the convergence of the…
We explore the cycles and convergence of Generalized Collatz Sequence, where $3n+1$ in original collatz function is replaced with $3n+k$. We present a generating function for cycles of GCS and show a particular inheritance structure of…
This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…
The Collatz problem with $3x+k$ is revisited. Positive and negative limit cycles are given up to k=9997 starting with $x_0=-2\cdot10^7...+2\cdot10^7$. A simple relation between the probability distribution for the Syracuse iterates for…
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…
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.