Related papers: A solution to the Straus-Erd\H{o}s conjecture

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

A new inequality, $(x)^{p}+(1-x)^{\frac{1}{p}}\leq1$ for $p \geq 1$ and $\frac{1}{2} \geq x \geq 0$ is found and proved. The inequality looks elegant as it integrates two number pairs ($x$ and $1-x$, $p$ and $\frac{1}{p}$) whose summation…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

Translated from the Latin original, "Observationes circa bina biquadrata quorum summam in duo alia biquadrata resolvere liceat" (1772). E428 in the Enestroem index. This paper is about finding A,B,C,D such that $A^4+B^4=C^4+D^4$. In sect.…

Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…

Erd\H{o}s and Hall defined a pair $(m, n)$ of positive integers to be interlocking, if between any pair of consecutive divisors (both larger than $1$) of $n$ (resp. $m$) there is a divisor of $m$ (resp. $n$). A positive integer is said to…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…

A Toda prime of an integer $n$ is an odd prime $p$ such that $4n=(p-1)k$ with $k$ coprime to $p$. We conjecture that every positive integer admits at least two Toda primes. We give a partial proof that every positive integer admits at least…

For any sufficiently large $\ell$, suppose that $\ell$ can be expressed as $$ \ell=p_1^4+p_2^4+p_3^4+ \cdots +p_8^4,$$ where $p_1, p_2,p_3,\cdots, p_8$ are primes.For such $\ell$, in this paper we will use circle method and sieves to prove…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

The Euler's form of odd perfect numbers, if any, is $n=\pi^{\alpha}N^2$, where $\pi$ is prime, $(\pi,N)=1$ and $\pi\equiv \alpha \equiv 1 \pmod{4}$. Dris conjecture states that $N>\pi^{\alpha}$. We find that $N^2>\frac{1}{2}\pi^{\gamma}$,…

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

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…

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…

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not…

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…