Related papers: A proof of Dejean's conjecture
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz conjecture is presented that works on a standard PC for…
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…
In [1], we give Dickson's conjecture on $N^n$. In this paper, we further give Dickson's conjecture on $Z^n$ and obtain an equivalent form of Green-Tao's conjecture [2]. Based on our work, it is possible to establish a general theory that…
It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…
Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…
The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…
We survey the state of the union-closed sets conjecture.
Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…
Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36…
In a recent paper, Svante Janson has considered a conjecture suggested by Va\v{s}ek Chv\a'atal dealing with the probability that a binomial random variable with parameters $n$ and $m/n$ - where $m$ is an integer - exceeds its expectation…
Quadratic conjecture is a strengthening of oliver's $p$-group conjecture. Let $G$ be a $p$-group of maximal class of order $p^n$. We prove that if $n\le 8$ or $n\ge \max\{2p-6,p+2\}$ then $G$ satisfies Quadratic Conjecture. Hence quadratic…
In this note, we prove the last remaining case of the original 15 two-term supercongruence conjectures for sporadic sequences. The proof utilizes a new representation for this sequence (due to Gorodetsky) as the constant term of powers of a…
We consider natural variants of Lehmer's unresolved conjecture that Ramanujan's tau-function never vanishes. Namely, for $n>1$ we prove that $$\tau(n)\not \in \{\pm 1, \pm 3, \pm 5, \pm 7, \pm 691\}.$$ This result is an example of general…
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…
This paper examines the concept of a combination rule for belief functions. It is shown that two fairly simple and apparently reasonable assumptions determine Dempster's rule, giving a new justification for it.
In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…
We prove Haynes' version of the Duffin--Schaeffer conjecture for the $p$-adic numbers. In addition, we prove several results about an associated related but false conjecture, related to $p$-adic approximation in the spirit of Jarn\'ik and…
A very simple but useful almost sure convergence theorem of probability is given.
The well-known $abc$-conjecture concerns triples $(a,b,c)$ of non-zero integers that are coprime and satisfy ${a+b+c=0}$. The strong $n$-conjecture is a generalisation to $n$ summands where integer solutions of the equation ${a_1 + \ldots +…
We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…