Related papers: Rich dynamical behaviors from a digital reversal o…
Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…
This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…
We generalize the classical "1089-number trick", which states that a certain combination of addition, subtraction and swapping the digits of a three-digit number will always output 1089. More precisely, we show that any pair of zero…
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…
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood,…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
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…
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz conjecture is presented that works on a standard PC for…
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
In this paper we shall show amazing behavior of some discrete maps using Collatze like problems and some advanced theories in analytic number theory and dynamical system,we have investigated the driven cubic-quintic Duffing equation such…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
On the 3x+1 problem, given a positive integer $N$, let $D\left( N \right) $, $O\left( N \right) $, $E\left( N \right) $ be the total iteration steps, the odd iteration steps and the even iteration steps when $N$ iterates to 1(except 1)…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this…
We present some interesting observations on the 3x+1 problem. We propose a new algorithm which eliminates certain steps while we check the action of 3x+1 procedure on a number. Also, we propose a reason why many numbers follow a similar…
We discuss in detail the dynamics of maps $z\mapsto ae^z+be^{-z}$ for which both critical orbits are strictly preperiodic. The points which converge to $\infty$ under iteration contain a set $R$ consisting of uncountably many curves called…
We will prove that there are trajectories generated by the function at the origin of the 5x+1 problem which are divergent. The iterative application of this function on the set of positive integers allows us to determine that more than 17%…