SearcharxivSearch

arXiv · 1403.5739

Remarks on the Egyptian 2/D table in favor of a global approach (D prime number)

Abstract

For h=3 or 4, Egyptian decompositions into h unit fractions, like 2/D = 1/D1 + ... +1/Dh, were given by using (h-1) divisors (di) of D1. This ancient modus operandi, well recognized today, provides Di=DD1/di for i greater than 1. Decompositions selected (depending on di) have generally been studied by modern researchers through the intrinsic features of di itself. An unconventional method is presented here without considering the di properties but just the differences d(h-1)-dh. In contrast to widespread ideas about the last denominator like 'Dh smaller than 1000', it is more appropriate to adopt a global boundary of the form 'Dh smaller or equal to 10D', where 10 comes from the Egyptian decimal system. Singular case 2/53 (with 15 instead of 10) is explained. The number of preliminary alternatives before the final decisions is found tobe so low (71) for h=3 or 4 that a detailed overview is possible. A simple additive method of trials, independent of any context, can be carried out, namely 2n+1= d2+ ... + dh. Clearly the decisions fit with a minimal value of the differences d(h-1)-dh, independently of any di values.

Explore related subjects

Keep this discovery

BibTeXRIS

Lionel Bréhamet. 2014-03-23. Remarks on the Egyptian 2/D table in favor of a global approach (D prime number). https://arxiv.org/abs/1403.5739

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO