Talk:Greedy algorithm for Egyptian fractions: Difference between revisions
Talk:Greedy algorithm for Egyptian fractions (view source)
Revision as of 18:07, 30 January 2023
, 1 year ago→Rename and rewrite task as "Greedy algorithm for Egyptian fractions"
(A problem with the current Python test result ?) |
|||
Line 92:
—[[User:dchapes|dchapes]] ([[User talk:dchapes|talk]] | [[Special:Contributions/dchapes|contribs]]) 21:56, 7 June 2018 (UTC)
:The "search through all possible expansions" will be time consuming as it is always an uncountable infinity. Using the example "5/121 = 1/33 + 1/121 + 1/363" and say 1=1/2 + 1/3 + 1/6 then 1/363 must equal 1/2*363 + 1/3*363 + 1/6*363 so 5/121 must equal 1/33+1/121+1/726+1/1089+1/2178. I can repeat for 1/2178 etc. for ever. I choose the the last term to ensure I don't accidently repeat the denominator ever. I could choose a different expansion of unity.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 18:07, 30 January 2023 (UTC)
==A problem with the current Python result ?==
| |||