enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Erdős–Straus conjecture - Wikipedia

    en.wikipedia.org/wiki/Erdős–Straus_conjecture

    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.

  3. Greedy algorithm for Egyptian fractions - Wikipedia

    en.wikipedia.org/wiki/Greedy_algorithm_for...

    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 ⁠ .

  4. Egyptian fraction - Wikipedia

    en.wikipedia.org/wiki/Egyptian_fraction

    The Rhind Mathematical Papyrus. An Egyptian fraction is a finite sum of distinct unit fractions, such as + +. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators differ from each other.

  5. List of conjectures by Paul Erdős - Wikipedia

    en.wikipedia.org/wiki/List_of_conjectures_by_Paul...

    The Erdős–Graham conjecture in combinatorial number theory on monochromatic Egyptian fraction representations of unity, proved by Ernie Croot in 2000. [12] The Erdős–Stewart conjecture on the Diophantine equation n! + 1 = p k a p k+1 b, solved by Florian Luca in 2001. [13]

  6. Category:Egyptian fractions - Wikipedia

    en.wikipedia.org/wiki/Category:Egyptian_fractions

    This page was last edited on 14 September 2019, at 05:13 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply.

  7. Ancient Egyptian mathematics - Wikipedia

    en.wikipedia.org/wiki/Ancient_Egyptian_mathematics

    Ancient Egyptian mathematics is the mathematics that was developed and used in Ancient Egypt c. 3000 to c. 300 BCE, from the Old Kingdom of Egypt until roughly the beginning of Hellenistic Egypt. The ancient Egyptians utilized a numeral system for counting and solving written mathematical problems, often involving multiplication and fractions .

  8. Odd greedy expansion - Wikipedia

    en.wikipedia.org/wiki/Odd_greedy_expansion

    The odd greedy algorithm cannot terminate when given a fraction with an even denominator, because these fractions do not have finite representations with odd denominators. Therefore, in this case, it produces an infinite series expansion of its input. For instance Sylvester's sequence can be viewed as generated by the odd greedy expansion of 1/2.

  9. Unit fraction - Wikipedia

    en.wikipedia.org/wiki/Unit_fraction

    The topic of Egyptian fractions has also seen interest in modern number theory; for instance, the Erdős–Graham problem [9] and the Erdős–Straus conjecture [10] concern sums of unit fractions, as does the definition of Ore's harmonic numbers.