Related papers: A new method to prove the Collatz conjecture
We present the long sought visual pattern in the Collatz problem with the aid of a logarithmic spiral. Using this newly discovered pattern, we show that the Collatz problem is linked to primes via Jacobsthal numbers. We then prove that no…
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…
In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…
We present an astonishingly simple and elegant proof of the celebrated Basel problem.
In 1937, Lothar Collatz conjectured that the sequence generated by the rule $f(n)=3n+1$ for $n\in\mathbb{N}$ odd, $f(n)=n/2$ for $n\in\mathbb{N}$ even, starting in any positive integer $n$ produces $1$. This is equivalent to (1) there are…
This paper intends to survey the vast literature devoted to a problem posed by Wilf in 1978 which, despite the attention it attracted, remains unsolved. As it frequently happens with combinatorial problems, many researchers who got involved…
Bourgain's slicing conjecture was recently resolved by Joseph Lehec and Bo'az Klartag. We present an alternative proof by establishing small ball probability estimates for isotropic log-concave measures. Our approach relies on the…
Fermat's Last Theorem is proved by using the philosophical and mathematical knowledge of 1637 when the French mathematician Pierre de Fermat claimed to have a truly marvelous proof of his conjecture. Our approach consists of setting three…
We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.
In this paper, we discuss the well known 3x+1 conjecture in form of the accelerated Collatz function T defined on the positive odd integers. We present a sequence of quotient spaces and an invertible map that are intrinsically related to…
This paper introduces prime holdout problems, a problem class related to the Collatz conjecture. After applying a linear function, instead of removing a finite set of prime factors, a holdout problem specifies a set of primes to be…
The Collatz conjecture states that repeated steps of $n\mathrm{\to }\mathrm{3}n\mathrm{+1}$ at odd numbers and $n\mathrm{\to }n\mathrm{/2}$ at even numbers amount to walks over root paths to the branching number $c=4$ in the `trivial'…
The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…
In this paper, we prove an almost 40 year old conjecture by H. Cohen concerning the generating function of the Hurwitz class number of quadratic forms using the theory of mock modular forms. This conjecture yields an infinite number of so…
We study a natural analogue of Collatz's Conjecture for polynomials over $\mathbb{F}_2$.
This survey is intended to provide an overview of one of the oldest and most celebrated open problems in combinatorial algebra: the word problem for one-relation monoids. We provide a history of the problem starting in 1914, and give a…
The Collatz problem with $3x+k$ is revisited. Positive and negative limit cycles are given up to k=9997 starting with $x_0=-2\cdot10^7...+2\cdot10^7$. A simple relation between the probability distribution for the Syracuse iterates for…
The total chromatic number conjecture which has appeared in a few hundred articles and in numerous books thus far is now one of the classic mathematical unsolved problems. It appears that many authors coincidentally have attributed it to…
The Collatz conjecture (or ``Syracuse problem'') considers recursively-defined sequences of positive integers where $n$ is succeeded by $\tfrac{n}{2}$, if $n$ is even, or $\tfrac{3n+1}{2}$, if $n$ is odd. The conjecture states that for all…