Related papers: Dejean's conjecture holds for n>=27

We extend Carpi's results by showing that Dejean's conjecture holds for n >= 30.

We prove Dejean's conjecture. Specifically, we show that Dejean's conjecture holds for the last remaining open values of n, namely 15 <= n <= 26.

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

It is known that the Scholz conjecture on addition chains is true for all integers $n$ with $\ell(2n) = \ell(n)+1$. There exists infinitely many integers with $\ell(2n) \leq \ell(n)$ and we don't know if the conjecture still holds for them.…

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

Levin's conjecture has been established to hold true for group equations of length up to seven. Recently, it is shown that Levin's conjecture is also true (modulo exceptional cases) for some group equations of length eight and nine. In this…

An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.

We prove that at least $\left( \dfrac{(1+\epsilon)2m}{N-1}+1+\epsilon \right)^N$, where $0\leqslant \epsilon <1$, many general points, satisfy Demailly's conjecture. Previously, it was known to be true for at least $(2m+2)^N$ many general…

In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $\Delta(n)$ is obtained. $\Delta(n)$ is…

The Scholz conjecture on addition chains states that $\ell(2^n-1) \leq \ell(n) + n -1$ for all integers $n$ where $\ell(n)$ stands for the minimal length of all addition chains for $n$. It is proven to hold for infinite sets of integers. In…

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

Let $\sigma(x)$ be the sum of the divisors of $x$. If $N$ is odd and $\sigma(N) = 2N$, then the odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and…

In this paper we establish a coarse Jacquet-Zagier trace identity for GL$(n).$ We prove the absolute convergence when $\Re(s)>1$ and $0<\Re(s)<1;$ and obtain holomorphic continuation under almost all character twist. Moreover, as an…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

In 1964 L. Auslander conjectured that every crystallographic subgroup of an the affine group is virtually solvable, i.e. contains a solvable subgroup of finite index. D. Fried and W. Goldman proved Auslander's conjecture for n = 3 using…

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

It has been long congectured that the crossing number of $C_m\times C_n$ is $(m-2)n$ for $2<m<=n$. In this paper we proved that conjecture is true for all but finitely many $n$ for each $m$. More specifically we proved conjecture for…

It is shown that if $H$ is a circulant Hadamard $4n\ti 4n $ then $n=1$. This proves the Hadamard circulant conjecture.