In mathematics, the greedy algorithm for Egyptian fractions is a greedy algorithm, first described by Fibonacci, for transforming rational numbers into Egyptian fractions. An Egyptian fraction is a representation of an irreducible fraction as a sum of distinct unit fractions, such as 5/6 = 1/2 + 1/3. As the name indicates, these representations have been used as long ago as ancient Egypt, but the first published systematic method for constructing such expansions is described in the Liber Abaci of Leonardo of Pisa (Fibonacci). It is called a greedy algorithm because at each step the algorithm chooses greedily the largest possible unit fraction that can be used in any representation of the remaining fraction.
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - Greedy algorithm for Egyptian fractions (en)
- Sylvester-expansie (nl)
- Жадный алгоритм для египетских дробей (ru)
|
| rdfs:comment
| - De Sylvester-expansie van een positieve breuk is de stijgende rij van positieve gehele getallen waarmee de breuk geschreven kan worden als Egyptische breuk zodanig dat steeds zo klein mogelijk is. Een Egyptische breuk is een som van stambreuken met natuurlijke getallen als noemers: Voor de Sylvester-expansie geldt nog: De expansie is genoemd naar de wiskundige James Joseph Sylvester, die ze in 1880 beschreef. (nl)
- Жадный алгоритм для египетских дробей — жадный алгоритм, который преобразует рациональные числа в египетские дроби, на каждом шаге выбирая наибольшую из возможных аликвотных дробей, которая может быть использована в остаточной дроби. Разложение, полученное жадным алгоритмом для числа , называется жадным египетским разложением, разложением Сильвестра или разложением Фибоначчи — Сильвестра числа . (ru)
- In mathematics, the greedy algorithm for Egyptian fractions is a greedy algorithm, first described by Fibonacci, for transforming rational numbers into Egyptian fractions. An Egyptian fraction is a representation of an irreducible fraction as a sum of distinct unit fractions, such as 5/6 = 1/2 + 1/3. As the name indicates, these representations have been used as long ago as ancient Egypt, but the first published systematic method for constructing such expansions is described in the Liber Abaci of Leonardo of Pisa (Fibonacci). It is called a greedy algorithm because at each step the algorithm chooses greedily the largest possible unit fraction that can be used in any representation of the remaining fraction. (en)
|
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| authorlink
| - James Joseph Sylvester (en)
|
| b
| |
| first
| |
| last
| |
| p
| |
| year
| |
| has abstract
| - In mathematics, the greedy algorithm for Egyptian fractions is a greedy algorithm, first described by Fibonacci, for transforming rational numbers into Egyptian fractions. An Egyptian fraction is a representation of an irreducible fraction as a sum of distinct unit fractions, such as 5/6 = 1/2 + 1/3. As the name indicates, these representations have been used as long ago as ancient Egypt, but the first published systematic method for constructing such expansions is described in the Liber Abaci of Leonardo of Pisa (Fibonacci). It is called a greedy algorithm because at each step the algorithm chooses greedily the largest possible unit fraction that can be used in any representation of the remaining fraction. Fibonacci actually lists several different methods for constructing Egyptian fraction representations . He includes the greedy method as a last resort for situations when several simpler methods fail; see Egyptian fraction for a more detailed listing of these methods. As Salzer (1948) details, the greedy method, and extensions of it for the approximation of irrational numbers, have been rediscovered several times by modern mathematicians, earliest and most notably by J. J. Sylvester; see for instance and . A closely related expansion method that produces closer approximations at each step by allowing some unit fractions in the sum to be negative dates back to . The expansion produced by this method for a number x is called the greedy Egyptian expansion, Sylvester expansion, or Fibonacci–Sylvester expansion of x. However, the term Fibonacci expansion usually refers, not to this method, but to representation of integers as sums of Fibonacci numbers. (en)
- De Sylvester-expansie van een positieve breuk is de stijgende rij van positieve gehele getallen waarmee de breuk geschreven kan worden als Egyptische breuk zodanig dat steeds zo klein mogelijk is. Een Egyptische breuk is een som van stambreuken met natuurlijke getallen als noemers: Voor de Sylvester-expansie geldt nog: De expansie is genoemd naar de wiskundige James Joseph Sylvester, die ze in 1880 beschreef. (nl)
- Жадный алгоритм для египетских дробей — жадный алгоритм, который преобразует рациональные числа в египетские дроби, на каждом шаге выбирая наибольшую из возможных аликвотных дробей, которая может быть использована в остаточной дроби. Разложение, полученное жадным алгоритмом для числа , называется жадным египетским разложением, разложением Сильвестра или разложением Фибоначчи — Сильвестра числа . (ru)
|
| gold:hypernym
| |
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)