Related papers: Collatz Theorem
We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…
For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
The goal of this notice is to present a proof of Bachet's conjecture based exclusively on the fundamental theorem of arithmetic. The novelty of this proof consists in its introduction of a partial order on rational integers through 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…
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…
Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…
In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…
Fermat's statement is equivalent to say that if $x$, $y$, $z$, $n$ are integers and $n>2$, then $z^{n}\gtrless x^{n}+y^{n}$. This is proved with the aid of numbers $\lambda $'s, of the form $\lambda =z/\rho $, with $1<\rho<z$, named…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
In 2021, J.~Agler and J.~E. McCarthy proposed a two-step programme toward the celebrated Krzy\.z conjecture. The first step is to prove an entropy conjecture for polynomials whose zeros all lie on the unit circle; the second is to establish…
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…
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…
In this paper we show the probabilistic convergence of the original Collatz (3n + 1) (or Hotpo) sequence to unity. A generalized form of the Collatz sequence (GCS) is proposed subsequently. Unlike Hotpo, an instance of a GCS can converge to…
By using properties of Markov homogeneous chains and Banach measure in $\mathrm{N}$, it is proved that a relative frequency of even numbers in the sequence of $n$-th coordinates of all Collatz sequences is equal to the number…
Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…