Egyptian fraction greedy algorithm
E1563168
UNEXPLORED
The Egyptian fraction greedy algorithm is a method for expressing any positive rational number as a sum of distinct unit fractions by repeatedly subtracting the largest possible unit fraction at each step.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Egyptian fraction greedy algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22964765 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Egyptian fraction greedy algorithm Context triple: [Sylvester sequence, relatedTo, Egyptian fraction greedy algorithm]
-
A.
Farey sequence
The Farey sequence is an ordered list of completely reduced fractions between 0 and 1 with denominators up to a given integer, widely studied in number theory for its connections to fractions, mediants, and modular forms.
-
B.
Erdős–Straus conjecture
The Erdős–Straus conjecture is an unsolved problem in number theory asserting that for every integer n ≥ 2, the fraction 4/n can be expressed as a sum of three unit fractions.
-
C.
Continued Fractions
Continued Fractions is a classic mathematical monograph by Aleksandr Khinchin that systematically develops the theory and applications of continued fraction expansions in number theory and analysis.
-
D.
Stern–Brocot tree
The Stern–Brocot tree is an infinite binary tree that systematically lists all positive rational numbers in lowest terms exactly once, ordered by increasing value.
-
E.
Zeckendorf
Zeckendorf is a surname most notably associated with American real estate developer William Zeckendorf and his influential role in mid-20th-century urban development.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Egyptian fraction greedy algorithm Target entity description: The Egyptian fraction greedy algorithm is a method for expressing any positive rational number as a sum of distinct unit fractions by repeatedly subtracting the largest possible unit fraction at each step.
-
A.
Farey sequence
The Farey sequence is an ordered list of completely reduced fractions between 0 and 1 with denominators up to a given integer, widely studied in number theory for its connections to fractions, mediants, and modular forms.
-
B.
Erdős–Straus conjecture
The Erdős–Straus conjecture is an unsolved problem in number theory asserting that for every integer n ≥ 2, the fraction 4/n can be expressed as a sum of three unit fractions.
-
C.
Continued Fractions
Continued Fractions is a classic mathematical monograph by Aleksandr Khinchin that systematically develops the theory and applications of continued fraction expansions in number theory and analysis.
-
D.
Stern–Brocot tree
The Stern–Brocot tree is an infinite binary tree that systematically lists all positive rational numbers in lowest terms exactly once, ordered by increasing value.
-
E.
Zeckendorf
Zeckendorf is a surname most notably associated with American real estate developer William Zeckendorf and his influential role in mid-20th-century urban development.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.