Greedy Algorithm For Egyptian Fractions
   HOME
*





Greedy Algorithm For Egyptian Fractions
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 . 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 was described in 1202 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 ( ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also ce ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

American Journal Of Mathematics
The ''American Journal of Mathematics'' is a bimonthly mathematics journal published by the Johns Hopkins University Press. History The ''American Journal of Mathematics'' is the oldest continuously published mathematical journal in the United States, established in 1878 at the Johns Hopkins University by James Joseph Sylvester, an English-born mathematician who also served as the journal's editor-in-chief from its inception through early 1884. Initially W. E. Story was associate editor in charge; he was replaced by Thomas Craig in 1880. For volume 7 Simon Newcomb became chief editor with Craig managing until 1894. Then with volume 16 it was "Edited by Thomas Craig with the Co-operation of Simon Newcomb" until 1898. Other notable mathematicians who have served as editors or editorial associates of the journal include Frank Morley, Oscar Zariski, Lars Ahlfors, Hermann Weyl, Wei-Liang Chow, S. S. Chern, André Weil, Harish-Chandra, Jean Dieudonné, Henri Cartan, Stephen S ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


American Mathematical Monthly
''The American Mathematical Monthly'' is a mathematical journal founded by Benjamin Finkel in 1894. It is published ten times each year by Taylor & Francis for the Mathematical Association of America. The ''American Mathematical Monthly'' is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. In this the ''American Mathematical Monthly'' fulfills a different role from that of typical mathematical research journals. The ''American Mathematical Monthly'' is the most widely read mathematics journal in the world according to records on JSTOR. Tables of contents with article abstracts from 1997–2010 are availablonline The MAA gives the Lester R. Ford Awards annually to "authors of articles of expository excellence" published in the ''American Mathematical Monthly''. Editors *2022– ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Odd Greedy Expansion
In number theory, the odd greedy expansion problem asks whether a greedy algorithm for finding Egyptian fractions with odd denominators always succeeds. , it remains unsolved. Description An Egyptian fraction represents a given rational number as a sum of distinct unit fractions. If a rational number x/y is a sum of unit fractions with odd denominators, :\frac = \sum\frac, then y must be odd. Conversely, every fraction x/y with y odd can be represented as a sum of distinct odd unit fractions. One method of finding such a representation replaces x/y by Ax/Ay where A=35\cdot 3^i for a sufficiently large i, and then expands Ax as a sum of distinct divisors of Ay.; . However, a simpler greedy algorithm has successfully found Egyptian fractions in which all denominators are odd for all instances x/y (with odd y) on which it has been tested: let u be the least odd number that is greater than or equal to y/x, include the fraction 1/u in the expansion, and continue in the same way (avoidi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Engel Expansion
The Engel expansion of a positive real number ''x'' is the unique non-decreasing sequence of positive integers \ such that :x=\frac+\frac+\frac+\cdots = \frac\left(1+\frac\left(1+\frac\left(1+\cdots\right)\right)\right) For instance, Euler's constant ''e'' has the Engel expansion :1, 1, 2, 3, 4, 5, 6, 7, 8, ... corresponding to the infinite series :e=\frac+\frac+\frac+\frac+\frac+\cdots Rational numbers have a finite Engel expansion, while irrational numbers have an infinite Engel expansion. If ''x'' is rational, its Engel expansion provides a representation of ''x'' as an Egyptian fraction. Engel expansions are named after Friedrich Engel, who studied them in 1913. An expansion analogous to an Engel expansion, in which alternating terms are negative, is called a Pierce expansion. Engel expansions, continued fractions, and Fibonacci observe that an Engel expansion can also be written as an ascending variant of a continued fraction: :x = \cfrac. They claim that ascending ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Irrational Number
In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being '' incommensurable'', meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself. Among irrational numbers are the ratio of a circle's circumference to its diameter, Euler's number ''e'', the golden ratio ''φ'', and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational. Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the cas ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

On-Line Encyclopedia Of Integer Sequences
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009. Sloane is chairman of the OEIS Foundation. OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. , it contains over 350,000 sequences, making it the largest database of its kind. Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword, by subsequence, or by any of 16 fields. History Neil Sloane started collecting integer sequences as a graduate student in 1965 to support his work in combinatorics. The database was at first stored on punched cards ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Golden Ratio
In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Expressed algebraically, for quantities a and b with a > b > 0, where the Greek letter phi ( or \phi) denotes the golden ratio. The constant \varphi satisfies the quadratic equation \varphi^2 = \varphi + 1 and is an irrational number with a value of The golden ratio was called the extreme and mean ratio by Euclid, and the divine proportion by Luca Pacioli, and also goes by several other names. Mathematicians have studied the golden ratio's properties since antiquity. It is the ratio of a regular pentagon's diagonal to its side and thus appears in the construction of the dodecahedron and icosahedron. A golden rectangle—that is, a rectangle with an aspect ratio of \varphi—may be cut into a square and a smaller rectangle with the same aspect ratio. The golden ratio has been used to analyze the proportions of natural object ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Root-finding Algorithm
In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function , from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number such that . As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound). Solving an equation is the same as finding the roots of the function . Thus root-finding algorithms allow solving any equation defined by continuous functions. However, most root-finding algorithms do not guarantee that they will find all the roots; in particular, if such an algorithm does not find any root, that does not mean that no root exists. Most nume ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Erdős–Straus Conjecture
The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer n that is 2 or more, there exist positive integers x, y, and z for which \frac=\frac+\frac+\frac. In other words, the number 4/n can be written as a sum of three positive unit fractions. The conjecture is named after Paul Erdős and Ernst G. Straus, who formulated it in 1948, but it is connected to much more ancient mathematics; sums of unit fractions, like the one in this problem, are known as Egyptian fractions, because of their use in ancient Egyptian mathematics. The Erdős–Straus conjecture is one of many conjectures by Erdős, and one of many unsolved problems in mathematics concerning Diophantine equations. Although a solution is not known for all values of , infinitely many values in certain infinite arithmetic progressions have simple formulas for their solution, and skipping these known values can speed up searches for counterexamples. Additionally, t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Perfect Number
In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number. The sum of divisors of a number, excluding the number itself, is called its aliquot sum, so a perfect number is one that is equal to its aliquot sum. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors including itself; in symbols, \sigma_1(n)=2n where \sigma_1 is the sum-of-divisors function. For instance, 28 is perfect as 1 + 2 + 4 + 7 + 14 = 28. This definition is ancient, appearing as early as Euclid's ''Elements'' (VII.22) where it is called (''perfect'', ''ideal'', or ''complete number''). Euclid also proved a formation rule (IX.36) whereby q(q+1)/2 is an even perfect number whenever q is a prime of the form 2^p-1 for positive integer p—what is now called a Mersenne prime. Two millennia ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]