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.
(In reply to
Simple proof by Federico Kereki)
What is the difference between your proof and that of David Shin (the very first one below)?

Posted by Richard
on 20041016 22:55:17 