相关论文: The Erd\H{o}s-Straus conjecture New modular equati…
We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…
We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.
Introduced by Erd\H{o}s in 1950, a covering system of the integers is a finite collection of arithmetic progressions whose union is the set $\mathbb{Z}$. Many beautiful questions and conjectures about covering systems have been posed over…
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…
This article proposes a unified analytical approach leading to a partial resolution of the Erdos-Straus, Sierpinski conjectures, and their generalization. We introduce an equivalent reformulation of these conjectures while constructing two…
Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…
The Erd\"{o}s-Straus conjecture states that the equation $\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$ has positive integer solutions $x, y, z$ for every postive integers $n\ge 2$. We generalize the Erd\"{o}s-Straus equation, state…
The Erd\H{o}s-Straus conjecture is a renowned problem which describes that for every natural number $n~(\ge 2)$, $\frac{4}{n}$ can be represented as the sum of three unit fractions. The main purpose of this study is to show that the…
The Erdos-Straus conjecture (ESC) concerns the representation of the fraction 4/P, where P is a prime number, as a sum of three positive unit fractions. The focus here is on the case when P is congruent to 1 modulo 4. Two constructive…
In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The…
The Erd\"{o}s--Straus conjecture states that the equation $\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$ has positive integer solutions $x,y,z$ for every postive integers $n\geq 2$. In this short note we find explicity the solutions of…
In number theory, the Erdos-Straus conjecture states that for all n >=2, the rational number 4/n can be expressed as the sum of three unit fractions. Paul Erdos and Ernst G. Straus formulated the conjecture in 1948. The restriction that the…
According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…
Erd\H{o}s and Gy\'arf\'as conjectured in 1994 that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs,…
In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…
A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…
According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…