Related papers: A variant of Collatz's Conjecture over Binary Poly…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

We establish an analogue of the Goldbach conjecture for Laurent polynomials with positive integer coefficients.

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

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…

An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.

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 prove the conjecture of Friedlander et al. about sums over Littelmann patterns for the the root system of type $G_2$, which is an analogue of Tokuyama's theorem for root systems of type $A_r$. We use elementary means to show that the…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any…

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.

We prove a conjecture of K. Marton, widely known as the polynomial Freiman--Ruzsa conjecture, in characteristic $2$. The argument extends to odd characteristic, with details to follow in a subsequent paper.

Collatz Conjecture (also known as Ulam's conjecture and 3x+1 problem) concerns the behavior of the iterates of a particular function on natural numbers. A number of generalizations of the conjecture have been subjected to extensive study.…

We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to…

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

We provide a proof of a variant of the Landau-Siegel Zeros conjecture.

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

We prove the dynamical Mordell-Lang conjecture for birational polynomial morphisms on $\mathbb{A}^2$.