Related papers: A solution of $3x+1$ problem
In this note, three 2003 problems of Nathanson and two 2007 problems of Chen on unique representation bases for the integers are resolved.
We provide an analytical closed-form solution of the exponential equation $a^x+a^{-x}=x$ for a specific value $a$, discuss the number of roots in general case, and provide bounds on the roots.
We survey the history of the capset problem in the context of related results on progression-free sets, discuss recent progress, and mention further directions to explore.
This paper studies certain trajectories of the Collatz function. I show that if for each odd number $n$, $n\sim 3n+2$ then every positive integer $n \in \mathbb{N}\setminus 2^{\mathbb{N}}$ has the representation…
We prove an improved form of an expectation of Polya and discuss several related questions
In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cases based on its remainder when divided by three. The…
We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…
This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…
In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also present strong arguments that this algorithm finds a solution (if it exists) for a 3SAT problem with high…
The (2+1)-dimensional integrable M-XX equation is considered.
The paper deals with the resolution of third and fourth degree equations by means of radicals. It is a survey of some historical details about this fundamental problem. Moreover, it explains practical methods for the resolution of third and…
Considering the equation $$a^x+b^y = c^z,$$ Le gives an upper bound on the number of solutions $(x,y,z)$, and a bound on $z$. Here we give slight improvements to these results, also removing the restriction that $a$, $b$, $c$ be squarefree.
This is a short historical note concerning the evolution of Wetzel's problem and Erdos' solution.
In this paper we present the algorithm of finding the solutions of the equation $x^3+ax=b$ in $\mathbb{Z}^*_3$ with coefficients from $\mathbb{Q}_3$.
Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…
This paper will be replaced later by a revised version.
We study the generalisation of Baxter's three-colour problem to a random lattice. Rephrasing the problem as a matrix model problem we discuss the analyticity structure and the critical behaviour of the resulting matrix model. Based on a set…
In this paper we define a small variation of the Taylor method and a formula for the global error of this new numerical method that allows us to keep track of the round-off error and does not require previous knowledge of the exact…
In this note, we give a short solution of the kissing number problem in dimension three.