Related papers: A note on the $3x+1$ conjecture

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…

We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.

Generalized octagonal numbers are those $p_8(x)=x(3x-2)$ with $x\in\mathbb Z$. In this paper we mainly show that every positive integer can be written as the sum of four generalized octagonal numbers one of which is odd. This result is…

The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…

In this paper, we show that certain sums of generalized $m$-gonal numbers represent every positive integer if and only if they represent every positive integer up to an explicit bound $C_m$, verifying a conjecture of Sun for sufficiently…

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

We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We…

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

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…

Paul Erdos conjectured that for every n in N, n>1, there exist a, b, c natural numbers, not necessarily distinct, so that 4/n=1/a+1/b+1/c (see \cite{rg}). In this paper we prove an extension of Mordell's theorem and formulate a conjecture…

The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of…

Let an odd integer \(\mathcal{X}\) be expressed as $\left\{\sum\limits_{M > m}b_M2^M\right\}+2^m-1,$ where $b_M\in\{0,1\}$ and $2^m-1$ is referred to as the Governor. In Collatz-type functions, a high index Governor is eventually reduced to…

In this paper, we consider the one-to-one correspondence between a 2-adic integer and its parity sequence under iteration of the so-called "3x+1" map. First, we prove a new formula for the inverse transform. Next, we briefly review what is…

In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.

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

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…

The ABC conjecture of Masser and Oesterle' states that if (a,b,c) are coprime integers with a + b + c = 0, then sup(|a|,|b|,|c|) < c_e (rad(abc))^{1+e} for any e > 0. Oesterle' has observed that if the ABC conjecture holds for all (a,b,c)…

The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…