Related papers: The Real 3x+1 Problem

In the Collatz 3x+1 problem, there are 3 possibilities: Starting from any positive number, we either reach the trivial loop (1,4,2), end up in a non-trivial loop, or go until infinity. In this paper, we shall show that if a non-trivial loop…

For any bent function, it is very interesting to determine its dual function because the dual function is also bent in certain cases. For $k$ odd and $\gcd(n, k)=1$, it is known that the Coulter-Matthews bent function…

In a previous article, we reduced the unsolved problem of the convergence of Collatz sequences, to convergence of Collatz sequences of odd numbers, that are divisible by 3. In this article, we further reduce this set to odd numbers that are…

This article introduces a new kind of number systems on $p$-adic integers which is inspired by the well-known $3n+1$ conjecture of Lothar Collatz. A $p$-adic system is a piecewise function on $\mathbb{Z}_p$ which has branches for all…

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…

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…

Under the 3x+1 problem, classified the number into four kind by mod 4. The four kind number can form a cycle base on 3x+b1 problem. Base on this cycle, if the number of kind number is zero the 3x+1 will be proofed.

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…

I show here that there are three different kinds of iterations for the reduced Collatz algorithm; depending on whether the root of the number is odd or even. There is only one kind of iteration if the root is odd and two kinds if the root…

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…

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…

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…

The objective of this paper is to show (a)=(b)=(c) as rational functions of $T$, $U$ for (a), (b), (c) given by (a) continued fractions of length $2^{n+1}-1$ with explicit partial denominators in $\left\{-T,U^{-1}T\right\}$, (b) truncated…

We present a solution of $3x+1$ problem. For a history of this problem we refer the reader to Lagarias, Jeffrey C.

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…

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…

In the context of the correspondence between real functions on the unit circle and inner analytic functions within the open unit disk, that was presented in previous papers, we show that the constructions used to establish that…

In this paper we show how the non-relativistic transport equations for a simple fluid can be obtained using a 3+1 representation. A pseudo-galilean transformation is introduced in order to obtain the Euler conservation laws. The…

The Collatz process is defined on natural numbers by iterating the map $T(x) = T_0(x) = x/2$ when $x\in\mathbb{N}$ is even and $T(x)=T_1(x) =(3x+1)/2$ when $x$ is odd. In an effort to understand its dynamics, and since Generalised Collatz…