Related papers: Collatz meets Fibonacci
The Collatz problem is related to the fixed point problem, and is widely used in mathematics. It has attracted a wide range of math enthusiasts, but is still difficult to solve. So, this article aimed to study the extension of the Collatz…
Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…
We investigate the structure of Collatz path sequences $\{F^k(n)\}_{k=0}^{\infty}$ for positive integers $n$, where $F$ denotes the standard Collatz map. By classifying natural numbers into residue classes modulo~4, we establish that the…
The \textit{order of appearance} $ z(n) $ of a positive integer $ n $ in the Fibonacci sequence is defined as the smallest positive integer $ j $ such that $ n $ divides the $ j $-th Fibonacci number. A \textit{fixed point} arises when, for…
Motivated by a recent work of Tr\"umper we consider the general Collatz word (up-down pattern) and the sequences following this pattern. The recurrences for the first and last sequence entries are given, obtained from repeated application…
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…
We here elaborate on a quantitative argument to support the validity of the Collatz conjecture, also known as the (3x + 1) or Syracuse conjecture. The analysis is structured as follows. First, three distinct fixed points are found for the…
We characterize all bounded orbits of two similar Collatz-type quadratic mappings of the set of non-negative integers. In one case, where cycles of all possible lengths may occur, an orbit is bounded if and only if it reaches a cycle. For…
We developed an algorithm that easily goes from one odd number to the next odd number in binary representation for the reduced forward Collatz map (Syracuse function). The algorithm indicates when an odd number can grow or shrink to the…
We analyze the stopping-time and cycle structure of the normalized Collatz iteration. Using a recursive description of admissible binary sequences, we show that every integer $m \equiv 3 \pmod{4}$ arises uniquely and derive new bounds for…
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,…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
Motivated by a balanced ternary representation of the Collatz map we define the map $C_\mathbb{R}$ on the positive real numbers by setting $C_\mathbb{R}(x)=\frac{1}{2}x$ if $[x]$ is even and $C_\mathbb{R}(x)=\frac{3}{2}x$ if $[x]$ is odd,…
This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function.…
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 <…
Taking a new approach towards analyzing the Collatz Problem, or, 3x+1 conjecture. Introducing some new functions, the Collatz-2 and Collatz-3 sequences, as well as deducing results related to Collatz-2 and Collatz-3 sequences.
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…
It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…