相关论文: The 3x+1 Problem: An Annotated Bibliography, II (2…

From a known result of diophantine equations of the first degree with 2 unknowns we simply find the results of the distribution function of the sequences of positive integers generated by the functions at the origin of the 3x+1 and 5x+1…

In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.

Numerical relativity is finally approaching a state where the evolution of rather general (3+1)-dimensional data sets can be computed in order to solve the Einstein equations. After a general introduction, three topics of current interest…

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

It is well known that the Collatz Conjecture can be reinterpreted as the Collatz Graph with root vertex 1, asking whether all positive integers are within the tree generated. It is further known that any cycle in the Collatz Graph can be…

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 3x+1 function T is defined on the positive integers by $T(x) = \frac{3x+1}{2}$ for x odd and $T(x) = \frac{x}{2}$ for x even. The function T has a natural extension to the 2-adic integers, and there is a continuous function $\Phi$ which…

We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by…

Open conjectures state that, for every $x\in[0,1]$, the orbit $\left(x_n\right)_{n=1}^\infty$ of the mean-median recursion $$x_{n+1}=(n+1)\cdot\mathrm{median}\left(x_1,\ldots,x_{n}\right)-\left(x_1+\cdots+x_n\right),\quad n\geqslant 3,$$…

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

It was conjectured by Furstenberg that for any $x\in [0,1]\backslash Q$, $$ \dim_H \bar{\{2^nx ({\text{mod}}\ 1): n\ge 1\}}+ \dim_H \bar{\{3^nx ({\text{mod}}\ 1): n\ge 1\}}\ge 1. $$ When $x$ is a normal number, the above result holds…

The 1-3-5 conjecture of Z.-W. Sun states that any $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as $x^2+y^2+z^2+w^2$ with $w,x,y,z\in\mathbb N$ such that $x+3y+5z$ is a square. In this paper, via the theory of ternary quadratic forms and…

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…

Motivated by a WhattsApp message, we find out the integers $x> y\ge 1$ such that $(x+1)/(y+1)=(x\circ(y+1))/(y\circ (x+1))$, where $\circ$ means the concatenation of the strings of two natural numbers (for instance $783\circ 56=78356$). The…

Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…

The forward prediction problem for a binary time series $\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based on the observations $X_i$, $0\le i\le n$ without prior knowledge of the distribution of the process…

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

In a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…

For any bent function, it is very interesting to determine its dual function because the dual function is also bent in certain cases. For $k$ odd and $\gcd(n, k)=1$, it is known that the Coulter-Matthews bent function…