Related papers: The Collatz 3n+1 Conjecture is Unprovable
Fermat's statement is equivalent to say that if $x$, $y$, $z$, $n$ are integers and $n>2$, then $z^{n}\gtrless x^{n}+y^{n}$. This is proved with the aid of numbers $\lambda $'s, of the form $\lambda =z/\rho $, with $1<\rho<z$, named…
In the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654), published in 2001, we studied the linearizability problem for 3-webs on a 2-dimensional manifold. Four years after the publication of our…
We provide a proof of the Borwein Conjecture using analytic methods.
According to Skolem's conjecture, if an exponential Diophantine equation is not solvable, then it is not solvable modulo an appropriately chosen modulus. Besides several concrete equations, the conjecture has only been proved for rather…
For a positive integer $n,$ define $$C_n=\prod_{k=1}^n(k^3+1).$$ In this paper we prove that there are no cubes in the integer sequence $C_n,~n=1,2,\cdots.$
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
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…
We explore the cycles and convergence of Generalized Collatz Sequence, where $3n+1$ in original collatz function is replaced with $3n+k$. We present a generating function for cycles of GCS and show a particular inheritance structure of…
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
Let $T \colon \mathbb{N} \to \mathbb{N}$ denote the $3x+1$ function, where $T(n)=n/2$ if $n$ is even, $T(n)=(3n+1)/2$ if $n$ is odd. As an accelerated version of $T$, we define a jump at $n \ge 1$ by jp$(n) = T^{(\ell)}(n)$, where $\ell$ is…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
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)…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
Let $\sigma_n=\lfloor1+n\cdot\log_23\rfloor$. For the Collatz 3x + 1 function exists for each $n\in\mathbb{N}$ a set of different residue classes $(\text{mod}\ 2^{\sigma_n})$ of starting numbers $s$ with finite stopping time…
Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…
Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.
The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.