Related papers: The Collatz process embeds a base conversion algor…

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…

In this paper, we discuss the well known 3x+1 conjecture in form of the accelerated Collatz function T defined on the positive odd integers. We present a sequence of quotient spaces and an invertible map that are intrinsically related to…

The famous (3n + 1) or Collatz conjecture has admitted some progress over the last several decades towards the conclusion that the conjecture is true (i.e. that all Collatz sequences will eventually reach a value of one), but has stubbornly…

We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…

Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…

In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…

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…

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…

In this paper, we convert Collatz map into a simple conjugate iterative maps defined in [0,1]. Such maps are more familiar to us and easier to deal with. Some new features of this map are observed by this method. An interesting heuristic…

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…

In this paper, we study the dynamics of an operator $\mathcal T$ naturally associated to the so-called Collatz map, which maps an integer $n \geq 0$ to $n / 2$ if $n$ is even and $3n + 1$ if $n$ is odd. This operator $\mathcal T$ is defined…

Let $q$ be an odd prime, and let $T_{q}:\mathbb{Z}\rightarrow\mathbb{Z}$ be the Shortened $qx+1$ map, defined by $T_{q}\left(n\right)=n/2$ if $n$ is even and $T_{q}\left(n\right)=\left(qn+1\right)/2$ if $n$ is odd. The study of the dynamics…

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 <…

This study analyzes the Collatz map through nonlinear dynamics. By embedding integers in Sharkovsky's ordering, we show that odd initial values suffice for full dynamical characterization. We introduce ``direction phases'' to partition…

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…

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

In the paper, from the point of view of recurrent numbers of the Jacobsthal type, the Collatz problem with the general aq+-1 function of conjecture odd positive integers q from the set of natural numbers is investigated. Formulated…

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…

In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…

In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…