相关论文: Collatz's "3x+1" problem and iterative maps on int…
The \textit{Collatz's conjecture} is an unsolved problem in mathematics. It is named after Lothar Collatz in 1973. The conjecture also known as Syrucuse conjecture or problem. Take any positive integer $ n $. If $ n $ is even then divide it…
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…
Commuting maps on a class of algebras called inflated algebras are investigated. In particular, we can prove that every commuting map $\theta$ on such an algebra is of the form $\theta(x)=c x+\mu(x)$, where $c$ belongs to the base field $K$…
Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. It is known that finite sequences of iterations with a given length and a given number of odd terms have some combinatorial properties…
We introduce here a classification of unimodal maps $[0, 1]\rightarrow [0, 1]$, which commute with piecewise linear surjective maps $[0, 1]\rightarrow [0, 1]$. Remind that if continuous piecewise linear unimodal map $g$ commutes with a…
The famous 3x + 1 problem of L. Collatz needs no introduction; however, this paper concerns a lesser-known, but similarly unresolved, precursor problem : the Original Collatz Conjecture, or OCC. We demonstrate that the core arithmetic…
In this paper, we introduced a three-step iterative process with errors for three multivalued mappings satisfying the condition (C) in uniformly convex Banach spaces and establish strong convergence theorems for the proposed process under…
Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…
The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…
We define Collatz representations for a subset of rational numbers and prove that each real number \( x \notin (-1,1) \) can be approximated arbitrarily well by rational numbers which have only \( 2 \)'s and \( 1 \)'s in their Collatz…
We establish an equivalent condition to the validity of the Collatz conjecture, using elementary methods. We derive some conclusions and show several examples of our results. We also offer a variety of exercises, problems and conjectures.
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…
A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab
The Kaczmarz method is a way to iteratively solve a linear system of equations $Ax = b$. One interprets the solution $x$ as the point where hyperplanes intersect and then iteratively projects an approximate solution onto these hyperplanes…
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…
Pairs of consecutive integers have the same height in the Collatz problem with surprising frequency. Garner gave a conjectural family of conditions for exactly when this occurs. Our main result is an infinite family of counterexamples to…
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%…
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
We introduce a new coupled map lattice model in which the weak interaction takes place via rare "collisions". By "collision" we mean a strong (possibly discontinuous) change in the system. For such models we prove uniqueness of the SRB…
Matching one set of objects to another is a ubiquitous task in machine learning and computer vision that often reduces to some form of the quadratic assignment problem (QAP). The QAP is known to be notoriously hard, both in theory and in…