Given a number of different fractions, create a new fraction whose numerator is the sum of all those fractions' numerators and whose denominator is the sum of the denominators. Call it y. Call the smallest of the original fractions x and the largest z.
Prove that for all cases, x < y < z.
Suppose a/b<c/d<e/f<...<s/t<u/v. We want to show that (a+c+e+...+s+u)/(b+d+f+...+t+v)<u/v. This is the same as seeing whether (a+c+e+...+s+u)v<(b+d+f+...+t+v)u.
Since a/b<u/v, av<bu, and similarly cv<du, ev<fu, ... sv<tu. Summing all these unequalities produces the result we sought.
The other proof (a/b<(a+c+e+...+s)/(b+d+f+...+t)<u/v) is similar.
Edited on October 16, 2004, 1:13 pm
Simple proof
