title: Egyptian Fractions in C
body: <p>The ancient Egyptians only used fractions of the form <code>1/n</code> so any other fraction had to be represented as a sum of such unit fractions and, furthermore, all the unit fractions were different! </p>
  
  <p>What is a good method to make any fraction an egyptian fraction (the less sums better) in C or java, what algorithm can be used, branch and bound, a*?</p>
  
  <p>for example:</p>
  
  <pre><code>3/4 = 1/2 + 1/4
  
  6/7 = 1/2 + 1/3 + 1/42 
  </code></pre>