Rosetta Code

Talk:Greedy algorithm for Egyptian fractions: Difference between revisions

Page Discussion

Talk:Greedy algorithm for Egyptian fractions (view source)

Revision as of 22:12, 4 April 2014

2,138 bytes added ,  10 years ago
→‎Request for task clarification: coming up with better verbage.
(→‎Request for task clarification: coming up with better verbage.)
Line 19:
 
Thanks. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 20:48, 4 April 2014 (UTC)
 
-----
 
I didn't think I had to define an improper fraction, as it is such a common term, plus there was a link to the Wikipedia entry defining the terms, but I'll enter it a few hours to give people a chance to respond to the descriptions/definitions below.   I didn't want to clutter up the task description or the task requirements defining basic arithmetic concepts.   Heaven knows what I entered will be "tidied" up so much so that it becomes almost ugly, but then one's man beauty is another's eyesore.   I was thinking of the below:
 
All proper fractions are of the form &nbsp; '''a/b''' &nbsp; where &nbsp; '''a''' &nbsp; and &nbsp; '''b''' &nbsp; are positive integers, such that &nbsp; '''a < b'''.
::::: (or, ··· &nbsp; such that &nbsp; ''' b > a ''').
--- I don't know which looks "nicer" or the easiest to eyeball.
 
 
<br>As for the 1- and 2-digit integers thingy requirement verbage, I couldn't think of a concise way to express it, but what I was thinking was to supposed to be transferred by mental telepathy, but I guess that didn't work.
 
For (the above), I meant, all proper fractions (that was implied) for one and two digit (positive) integers, such as:
 
1/2, 1/3, 1/4, 1/5, 1/6, 1/7, 1/8, 1/9/ 1,10, 1/11, 1/12, &nbsp; ··· &nbsp; 1/97, 1/98, 1/99, &nbsp; and
<br> 2/3, 2/4, 2/5, 2/6, &nbsp; ··· &nbsp; 2/97, 2/98, 2/99, &nbsp; and
: ··· &nbsp; and
96/99, 97/99, and 98/99.
 
After a few days to mull it over, here's what I came up with, I may append (or replace) the (below) as part of the requirement's verbage:
 
 
For the requirement:
 
"for all 1- and 2-digit integers, find and show an Egyptian fraction that has: the largest number of terms; the largest denominator"
 
<br> How about:
 
for all proper fractions, &nbsp; '''a/b''' &nbsp; where &nbsp; '''a''' &nbsp; and &nbsp; '''b''' &nbsp; are positive one-or two-digit (decimal) integers, find and show an Egyptian fraction that has:
::* the largest number of terms, &nbsp;
::* the largest denominator.
 
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:12, 4 April 2014 (UTC)
 
-----
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/245606"