Egyptian Fractions Generalized
For all m/n<=(r-s), there exists xj, yk s.t. m/n = {SUM(j=1 to r) 1/xj} – {SUM(k=1 to s) 1/yk}
=> m<2(r-s)
Proof:
by transposition