Related papers: Egyptian Fractions
We explore a novel link between two seemingly disparate mathematical concepts: Egyptian fractions and fractals. By examining the decomposition of rationals into sums of distinct unit fractions, a practice rooted in ancient Egyptian…
This paper introduces a new equation for rewriting two unit fractions to another two unit fractions. This equation is useful for optimizing the elements of an Egyptian Fraction. Parity of the elements of the Egyptian Fractions are also…
We give a sharp upper bound for the entries of the representations of a rational number as a sum of Egyptian fractions.
Every positive rational number has representations as Egyptian fractions (sums of reciprocals of distinct positive integers) with arbitrarily many terms and with arbitrarily large denominators. However, such representations normally use a…
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…
Results about the structure of the set of Egyptian fractions on the line are extended to subsets of topological groups.
A unit fraction representation of a rational number $r$ is a finite sum of reciprocals of positive integers that equals $r$. Of particular interest is the case when all denominators in the representation are distinct, resulting in an…
Resolving a conjecture of Zhi-Wei Sun, we prove that every rational number can be represented as a sum of distinct unit fractions whose denominators are practical numbers. The same method applies to allowed denominators that are closed…
An Egyptian fraction is a sum of the form $1/n_1 + \cdots + 1/n_r$ where $n_1, \dots, n_k$ are distinct positive integers. We prove explicit lower bounds for the cardinality of the set $E_N$ of rational numbers that can be represented by…
The notion of an \emph{Egyptian} integral domain $D$ (where every fraction can be written as a sum of unit fractions with denominators from $D$) is extended here to the notion that a ring $R$ is \emph{$W$-Egyptian}, with $W$ a…
For any integer $N \geq 1$, let $\mathfrak{E}_N$ be the set of all Egyptian fractions employing denominators less than or equal to $N$. We give upper and lower bounds for the cardinality of $\mathfrak{E}_N$, proving that $$ \frac{N}{\log N}…
We find the closest approximation to 1 from below using a sum of $n$ Egyptian fractions.
Egyptian decompositions of 2/D as a sum of two unit fractions are studied by means of certain divisors of D, namely r and s. Our analysis does not concern the method to find r and s, but just why the scribes have chosen a solution instead…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
Let $\mathcal A = (A_1,\ldots, A_n)$ be a sequence of nonempty finite sets of positive real numbers, and let $\mathcal{B} = (B_1,\ldots, B_n)$ be a sequence of infinite discrete sets of positive real numbers. A weighted real Egyptian number…
Given an integer partition of $n$ into distinct parts, the sum of the reciprocal parts is an example of an egyptian fraction. We study this statistic under the uniform measure on distinct parts partitions of $n$ and prove that, as $n \to…
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…
Answering a question of Erd\H{o}s and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive integers each at most $n$ is $2^{(c_x + o(1))n}$ for an…
We show that each rational number $r$, $0\le r<1$, occurs as the fractional part of a Dedekind sum $S(m,n)$.
Multiplication and exponentiation can be defined by equations in which one of the operands is written as the sum of powers of two. When these powers are non-negative integers, the operand is integer; without this restriction it is a…