Category:Fibonacci's Greedy Algorithm

From ProofWiki

Jump to navigation Jump to search

Pages in category "Fibonacci's Greedy Algorithm"

The following 5 pages are in this category, out of 5 total.

C

Condition for 3 over n producing 3 Egyptian Fractions using Greedy Algorithm when 2 Sufficient

F

Fibonacci's Greedy Algorithm

P

Proper Fraction can be Expressed as Finite Sum of Unit Fractions/Fibonacci's Greedy Algorithm

S

Smallest n for which 3 over n produces 3 Egyptian Fractions using Greedy Algorithm when 2 Sufficient

U

Upper Limit of Number of Unit Fractions to express Proper Fraction from Greedy Algorithm

Retrieved from "https://proofwiki.org/w/index.php?title=Category:Fibonacci%27s_Greedy_Algorithm&oldid=478021"