Related papers: A solution of $3x+1$ problem
Discussion about the convergence and divergence of trajectories generated by certain functions derived from generalized 3x+1 mappings
We claim to resolve the P=?NP problem via a formal argument for P=NP.
On the 3x+1 problem, given a positive integer $N$, let $D\left( N \right) $, $O\left( N \right) $, $E\left( N \right) $ be the total iteration steps, the odd iteration steps and the even iteration steps when $N$ iterates to 1(except 1)…
The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the…
We obtain, by using the Leggett-Williams fixed point theorem, sufficient conditions that ensure the existence of at least three positive solutions to some $p$-Laplacian boundary value problems on time scales.
The 3x+1 semigroup is the multiplicative semigroup generated by the rational numbers of form (2k+1)/(3k+2) for non-negative k, together with 2. This semigroup encodes backward iteration under the 3x+1 map, and the 3x+1 conjecture implies…
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…
An exactly solvable sphaleron model in $3+1$ spacetime dimensions is described
In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…
In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this…
We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…
Let $N_a$ be the number of solutions to the equation $x^{2^k+1}+x+a=0$ in $\GF {n}$ where $\gcd(k,n)=1$. In 2004, by Bluher \cite{BLUHER2004} it was known that possible values of $N_a$ are only 0, 1 and 3. In 2008, Helleseth and Kholosha…
The search for new integrable (3+1)-dimensional partial differential systems is among the most important challenges in the modern integrability theory. It turns out that such a system can be associated to any pair of rational functions of…
I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.
The Collatz conjecture (also known as the $3x+1$ problem) concerns the behavior of the discrete dynamical system on the positive integers defined by iteration of the so-called $3x + 1$ function. We investigate analogous dynamical systems in…
It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…
In this paper, we obtain the general solution and investigate the generalized Hyers-Ulam-Rassias stability for the new mixed type additive and cubic functional equation $$3f(x+3y) - f(3x + y)=12[f(x+y)+f(x-y)]-16[f(x)+f(y)] + 12f(2y) -…
We prove some results on the existence and compactness of solutions of a fractional Nirenberg problem.