Related papers: On the Collatz general problem $qn+1$
The generalized Chazy differential equation corresponds to the following two-parameter family of differential equations \begin{equation*}\label{gcdeq} \dddot x+|x|^q \ddot x+\dfrac{k |x|^q}{x}\dot x^2=0, \end{equation*} which has its…
The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…
Sequences of rational powers \left( \xi\left( \frac{p}{q} \right)^{n} \right)_{n\ge 0}, especially in the case \frac{p}{q}=\frac{3}{2}, have a connection with many important combinatorics and number theory problems as for example Syracuse,…
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…
The infamous 3x+1 conjecture spread by Lothar Collatz in 1952, despite its elementary formulation, remained unproved for over 60 years. From the heuristical probabilistic approach to the complex mapping of the algorithm, the scientific…
The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…
The Collatz Conjecture's connection to dynamical systems opens it to a variety of techniques aimed at recurrence and density results. First, we turn to density results and strengthen the result of Terras through finding a strict rate of…
The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any…
The $3x+1$ Conjecture asserts that the $T$-orbit of every positive integer $x$ contains $1$, where $T$ maps $x$ to $x/2$ for $x$ even and to $(3x+1)/2$ for $x$ odd. Several authors have studied the analogous map, $T_q$, which maps $x\in…
In this paper we introduce and discuss the sequence of \emph{real numbers} defined as $u_0 \in \mathbb R$ and $u_{n+1} = \Delta(u_n)$ where \begin{equation*} \Delta(x) = \begin{cases} \frac{x}{2} &\text{if }…
In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
Consider a finite positive integer. If it is even, divide it by 2, and if it is odd, multiply it by 3 and add 1. This will give you a new integer. Following the procedure for the new integer, you will receive another integer. Repeat the…
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…
Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.
It is well known that the Collatz Conjecture can be reinterpreted as the Collatz Graph with root vertex 1, asking whether all positive integers are within the tree generated. It is further known that any cycle in the Collatz Graph can be…
By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…
The 3x+1 problem concerns iteration of the map T(n) =(3n+1)/2 if n odd; n/2 if n even. The 3x +1 Conjecture asserts that for every positive integer n>1 the forward orbit of n includes the integer 1. This paper is an annotated bibliography…
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…