Related papers: About the proof of the Collatz conjecture
In this article, we prove the remaining open cases of the Fontaine-Mazur conjecture on two-dimensional regular Galois representations over $\Gal(\overline{\Q}/\Q)$ when $p=3$, hence concluding the conjecture in the regular case for all odd…
Professor Cadogan at the University of the West Indies identified special starting points that yield long subsequences where the normalization constant, k, is always one. I studied these special sequences and found an implicit mixed integer…
The $3x+1$ problem concerns the iteration of the map $T:\mathbb{Z}\to\mathbb{Z}$ defined by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. We study the \emph{coefficient stopping time} dynamics of $T$ (in the sense of Terras) by…
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…
For any positive integer $n$, define an iterated function $$ f(n)=\left\{\begin{array}{ll} n/2, & \mbox{$n$ even,} \\ 3n+1, & \mbox{$n$ odd.} \end{array} \right. $$ Suppose $k$ (if it exists) is the lowest number such that $f^{k}(n)<n$, and…
M. Crouzeix formulated the following conjecture in (Integral Equations Operator Theory 48, 2004, 461--477): For every square matrix $A$ and every polynomial $p$, $$ \|p(A)\| \le 2 \max_{z\in W(A)}|p(z)|, $$ where $W(A)$ is the numerical…
"Goldbach's Conjecture" proven by analysis of how all combinations of the odd primes, summed in pairs, generates all of the even numbers.
A number of the form $x(x+1)/2$ where $x$ is an integer is called a triangular number. Suppose, $N(a_1,\cdots,a_k;n)$ and $T(a_1,\cdots,a_k;n)$ denote the number of ways $n$ can be expressed as $\sum_{i=1}^k a_ix_i^2$ and $\sum_{i=1}^k…
The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
Take an odd number x >0. Then 3x+1 is even and one can find an integer k> 0 so that y= 3x+1/2^k is again odd. We get in this way the mapping T, Tx=y. The paper contains two theorems describing statistical properties of T. The first…
For an integer $x$ let $t_x$ denote the triangular number $x(x+1)/2$. Following a recent work of Z. W. Sun, we show that every natural number can be written in any of the following forms with $x,y,z\in\Z$: $$x^2+3y^2+t_z, x^2+3t_y+t_z,…
The Erd\H{o}s-Straus conjecture is a renowned problem which describes that for every natural number $n~(\ge 2)$, $\frac{4}{n}$ can be represented as the sum of three unit fractions. The main purpose of this study is to show that the…
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…
We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…
This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…
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.
The Scholz conjecture on addition chains states that $\ell(2^n-1) \leq \ell(n) + n -1$ for all integers $n$ where $\ell(n)$ stands for the minimal length of all addition chains for $n$. It is proven to hold for infinite sets of integers. In…
We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…
We introduce the \emph{Collatz conjecture} and its history. Some definition that this conjecture has, will be expressed and with these we try to explain some good lemma to justify the main properties of the \emph{Collatz conjecture}. With…