A rational number is expressed in Egyptian form if it is written as the sum of fractions with numerator one and all the denominators are distinct. An apparently new algorithm is presented, together with the elementary theory on which the method is based. The algorithm is particularly easy to handle in base 2 and is linked to the binary remainder method; a brief appendix gives some background literature.