Related papers: A note on the Erd\H{o}-Straus Conjecture

Alon, Frankl, and Lov\'asz proved a conjecture of Erd\H{o}s that one needs at least $\lceil \frac{n-r(k-1)}{r-1} \rceil$ colors to color the $k$-subsets of $\{1, \dots, n\}$ such that any $r$ of the $k$-subsets that have the same color are…

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) =…

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

Lately, Werner Schulte has conjectured that for all positive $n>1$, $n$ divides $\frac{(n-2)! (n-1)!}{2^{n-3}} + 4$ if and only if $n$ is prime. In this paper, We use elementary methods, to give a simple proof of this conjecture.

Let $E$ be an elliptic curve over $\mathbb{Q}.$ Let $a_p$ denote the trace of the Frobenius endomorphism at a rational prime $p$. For a fixed integer $r,$ define the prime-counting function as $\pi_{E,r}(x):=\sum_{p\leq x,p\nmid…

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

The Erd\H{o}s-S\'{o}s Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that Erd\H{o}s-S\'{o}s Conjecture is true for…

We show that for any sequence $f: {\bf N} \to \{-1,+1\}$ taking values in $\{-1,+1\}$, the discrepancy $$ \sup_{n,d \in {\bf N}} \left|\sum_{j=1}^n f(jd)\right| $$ of $f$ is infinite. This answers a question of Erd\H{o}s. In fact the…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

In this paper, we prove a conjecture of the second author by evaluating the determinant $$\det\left[x+\left(\frac{i-j}p\right)+\left(\frac ip\right)y+\left(\frac jp\right)z+\left(\frac{ij}p\right)w\right]_{0\le i,j\le(p-3)/2}$$ for any odd…

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

Let $f:\Z/q\Z\rightarrow\Z$ be such that $f(a)=\pm 1$ for $1\le a<q$, and $f(q)=0$. Then Erd\"os conjectured that $\sum_{n\ge1}\frac{f(n)}{n} \ne 0$. For $q$ even, this is trivially true. If $q\equiv 3$ ( mod $4$), Murty and Saradha proved…

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

In 1944, P. Erd\H{o}s \cite{1} proved that if $n$ is a large highly composite number (HCN) and $n_1$ is the next HCN, then $$n<n_1<n+n(\log n)^{-c},$$ where $c>0$ is a constant. In this paper, using numerical results by D. A. Corneth, we…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Let $p$ be a prime and, for $A\subseteq \mathbb F_p$, define $A^\ast=(A+A)\cup(AA)$. S\'ark\"ozy conjectured that there exist constants $c>0$ and $p_0$ such that, for every prime $p>p_0$, every set $A\subseteq \mathbb F_p$ with…

We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory Th(Z,+,1,0,Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable and supersimple. This is in…

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…