You should read about Egyptian Fractions first: https://en.wikipedia.org/wiki/Egyptian_fraction Write a method that returns the "hungry" form of an Egyptian Fraction for the given numerator and denominator. The term "hungry" is something I just made up (I think). It means that you keep taking out the largest valued fraction possible. For example, 17/30 becomes 1/2+1/16+1/241+1/57841 because you first take out 1/2 which is the largest fraction less than 17/30 with a unit numerator. Then you take out 1/16 because it is the largest remaining unit numerator fraction. This process continues until you have a sum that is equal to the original fraction (or at least within the tolerance described next). Note: Your answer does NOT have to be EXCATLY equal to the original fraction! You just need to be within 0.00000001 of the original value.