Related papers: On Egyptian fractions

The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b, c, d \in…

From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…

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…

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

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…

Erd\H{o}s and Graham found it conceivable that the best $n$-term Egyptian underapproximation of almost every positive number for sufficiently large $n$ gets constructed in a greedy manner, i.e., from the best $(n-1)$-term Egyptian…

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…

We develop a parametric approach to study the Diophantine equation $\frac{k}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$, underlying the Erd\H{o}s--Straus ($k=4$), Sierpi\'nski ($k=5$), and related generalizations. We introduce and…

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…

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.

The generalized Erd\H{o}s-Straus conjecture, proposed by Wac\l{}aw Sierpi\'{n}ski in 1956, asks whether the Diophantine equation \[ \frac{5}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b,c,d \in…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

This paper attempts to prove the Sylvester's conjecture using Egyptian Fractions with two key ingredients. First, creating a set of operators that completely generates all possible Egyptian fraction of 1. And second, to detect patterns in…

Let $n,d$, and $k$ be positive integers where $n$ and $d$ are coprime. Our two main results are Theorem 1. There is a partition of the infinite interval $[kd,\infty)$ of positive integers into a family of finite sets $X$ for which the sum…

In this paper we classify certain values of p that satisfy the Erdos-Straus conjecture, concerning the decomposition of fractions of the form 4/n as sum of three fractions with numerator identically equal to 1, not according to their…

An Egyptian fraction is a sum of distinct unit fractions (reciprocals of positive integers). We show that every rational number has Egyptian fraction representations where the number of terms is of the same order of magnitude as the largest…

From varying Egyptian fraction equations we obtain generalizations of primary pseudoperfect numbers and Giuga numbers which we call prime power psuedoperfect numbers and prime power Giuga numbers respectively. We show that a sequence of…

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} $$

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…

This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either:…