相关论文: Further verification and empirical evidence for th…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

This paper makes a fundamental assertion about the Erd\H{o}s-Straus conjecture. Suppose that for a prime $p$ there exists $x,y,z \in \mathbb{N}$ with $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}. $$ The…

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…

This paper outlines a solution to the Straus Erd\H{o}s Conjecture. Namely for each prime $p$ there exists positive integers $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z} $$

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…

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

This paper is a preliminary expository paper that outlines the relationship between solutions to the Erd\H{o}s-Straus conjecture for a given prime $p$ and their corresponding Pythagorean triples. This paper also uses B\'{e}zout Coefficients…

We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…

In this paper we use computational methods to disprove a conjecture by Alaoglu and Erd\H{o}s regarding the superabundant numbers.

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…

In this article, we establish an additive decomposition of the discrete zeta function (for $s \in \mathbb{N}^*$, $s > 1$), more precisely of the function $4(\zeta(s)-1)$, as a series whose general term is of the form $1/x_n(s) + 1/y_n(s) +…

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…

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that…

In this paper we consider Erd\"os-Mordell inequality and its extension in the plane of triangle to the Erd\"os-Mordell curve. Algebraic equation of this curve is derived, and using modern computer tools in mathematics, we verified one…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

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…

In 1999 Allan Swett checked (in 150 hours) the Erd\H{o}s-Straus conjecture up to $N=10^{14}$ with a sieve based on a single modular equation. After having proved the existence of a "complete" set of seven modular equations (including three…

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…

We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…