Greedy algorithm for Egyptian fractions: Difference between revisions

Greedy algorithm for Egyptian fractions (view source)

106 bytes added , 6 months ago

Added link to numberphile video

1,466

edits

Revision as of 17:17, 31 October 2023 (view source) Simonjsaunders (talk \| contribs) m (Minor edit to C++ code) ← Older edit		Latest revision as of 16:12, 12 December 2023 (view source) GordonCharlton (talk \| contribs) (Added link to numberphile video)
(One intermediate revision by one other user not shown)
Line 41: ;Also see: *   Wolfram MathWorld™ entry: [http://mathworld.wolfram.com/EgyptianFraction.html Egyptian fraction] *   Numberphile YouTube video: [https://youtu.be/aVUUbNbQkbQ Egyptian Fractions and the Greedy Algorithm] <br><br> Line 3,768 ⟶ 3,769: {{libheader\|Wren-big}} We use the BigRat class in the above module to represent arbitrary size fractions. <syntaxhighlight lang="~~ecmascript~~wren">import "./big" for BigInt, BigRat var toEgyptianHelper // recursive