Primary & Middle School Mathematics · Grades 1–9
55Fractions: All Four Operations
This chapter completes the arithmetic of fractions: addition and subtraction with any denominators, multiplication, and — the newcomer — division, which turns out to be a multiplication in disguise. Signs from Chapter 54 come along for the ride.
55.1 Adding with any denominators
Method 55.1 (Common denominator)
To add or subtract and :
- find a common multiple of and (the product always works; a smaller one saves effort);
- rewrite both fractions with that denominator;
- add or subtract the numerators; simplify.
Example 55.2
Compute . A common multiple of and is :
With signs: .
55.2 Multiplying fractions
Theorem 55.3 (Product of fractions)
Why, on a picture. Take of of a square: cut the square in vertical strips and keep ; cut horizontally in and keep rows of what remained. The kept part is a grid of small cells out of : fraction . ∎
Example 55.4
Simplify before multiplying, crossing out common factors:
(the factor and one factor cancel between top and bottom). With signs, the rules of Theorem 54.1 apply first: .
55.3 Dividing fractions
Definition 55.5 (Inverse)
The inverse of a nonzero number is the number which multiplied by gives . The inverse of is , since ; the inverse of an integer is .
Theorem 55.6 (Dividing means multiplying by the inverse)
For :
Example 55.7
A sanity check: dividing by , a number smaller than , must give a result larger than — and indeed ().
Example 55.8 (Fraction bars within fraction bars)
A “double-decker” is just a division written vertically:
Locate the main bar first (the longest one), then apply Theorem 55.6.
Method 55.9 (Mixed computations)
In an expression mixing fractions and the four operations:
- apply the usual priorities (Chapter 45);
- convert every division into a multiplication by the inverse;
- decide signs first (Method 54.6), then multiply or find common denominators;
- simplify at the earliest opportunity.
Example 55.10
55.4 Exercises
Exercise 55.1 ★
Compute and simplify:
Solution
Solution of Exercise 55.1.
.
.
.
Exercise 55.2 ★
Compute (signs first):
Solution
Solution of Exercise 55.2.
.
.
.
Exercise 55.3 ★
Compute, simplifying before multiplying:
Solution
Solution of Exercise 55.3.
(simplify by and by ).
(simplify by and by ).
(opposite signs: negative).
Exercise 55.4 ★
Give the inverse of: ; ; ; .
Exercise 55.5 ★
Compute:
Solution
Solution of Exercise 55.5.
.
.
.
Exercise 55.6 ★
Compute the double-deckers:
Solution
Solution of Exercise 55.6.
.
.
.
Exercise 55.7 ★
Compute, respecting priorities:
Exercise 55.8 ★★
A tank is full. One adds of the tank’s capacity. What fraction of the tank is now full? What fraction is still empty?
Solution
Solution of Exercise 55.8.
Full: of the tank. Empty: .
Exercise 55.9 ★★
Three quarters of the students of a class passed a test; among those, two thirds got more than out of . What fraction of the class got more than ? If that represents students, how large is the class?
Solution
Solution of Exercise 55.9.
Fraction with more than : of the class. If that is students, the class has students.
Exercise 55.10 ★★
A rope of m must be cut into pieces of m each. How many pieces does one get? (A division of fractions — check that the answer is a whole number.)
Solution
Solution of Exercise 55.10.
pieces — a whole number, no rope wasted.
Exercise 55.11 ★★
Compute
Solution
Solution of Exercise 55.11.
: division first: ; then .
(the square is positive).
Exercise 55.12 ★★★
Simplify the expression
(start from the innermost fraction and work outward, one bar at a time).
Solution
Solution of Exercise 55.12.
From the inside out: ; then ; then
55.5 Problem: Egyptian fractions
Problem 55.1
Weekend problem — every fraction is a sum of distinct unit fractions
A unit fraction is a fraction with numerator . The scribes of ancient Egypt — the Rhind papyrus was copied around BC — wrote every fraction as a sum of distinct unit fractions: never , but . Such a sum is called an Egyptian writing of the fraction. This problem develops the addition and comparison techniques of this chapter (Method 55.1) into a method — published by Fibonacci in — that produces an Egyptian writing of any fraction between and , and ends with a celebrated inheritance puzzle.
Part I — Unit fractions and the splitting identity.
- Compute and , and deduce Egyptian writings of and .
- Verify the scribes’ entry for : show that .
Check that and that . Then prove the splitting identity: for every whole number ,
- Deduce an Egyptian writing of itself, as a sum of three distinct unit fractions.
- Split the last term of to obtain a second Egyptian writing of , with three unit fractions. Explain why no fraction has a unique Egyptian writing.
Part II — Fibonacci’s greedy method. The method is: subtract the largest unit fraction that fits, and repeat with what remains.
- Using common denominators, show that . Why does this prove that is the largest unit fraction smaller than ?
- Compute . Which writing of does the greedy method produce?
- Now take . Show that the largest unit fraction smaller than is , and compute .
Show that the largest unit fraction smaller than is (compare with and with ), compute , and conclude:
Verify this writing directly with the common denominator .
- Run the greedy method on , checking at each step that your unit fraction is the largest one that fits, and verify the final writing.
Part III — Why the method always stops, and the eighteenth camel.
- In questions 7–10 the method was applied to , and . For each, list the numerators of the successive remainders (before any simplification). What do you observe?
For a fraction and a whole number , show that
Suppose the greedy method subtracts from : then fits but is already too big, . Putting both over the common denominator , deduce that , hence that the new numerator satisfies
Explain why this proves that the method always stops.
- An old tale: a father dies leaving camels, willing of the herd to his eldest child, to the second, to the third — and none of the shares is a whole number of camels. A neighbour lends the family an eighteenth camel; the children take , and camels, and the borrowed camel is returned. Compute and explain the trick: why could the herd be shared in whole camels, and why did no child receive less than the will promised?
- Repair the will: propose three distinct unit fractions that add up to exactly , and give the smallest herd size for which all three shares are whole numbers of camels.
Solution
Solution of Problem 55.1.
1. and . So and are Egyptian writings (distinct unit fractions in each).
2. With the common denominator :
3. , and . In general, the common denominator of and is :
4. Start from and split the second half by question 3:
three distinct unit fractions.
5. Splitting the in gives
No Egyptian writing is ever unique: the splitting identity can always replace the unit fraction with the largest denominator by two new, even smaller unit fractions — so from any writing one manufactures another.
6. With denominator : . With denominator : . Unit fractions shrink as their denominators grow, ; since (and everything above it) is too big and fits, is the largest unit fraction smaller than .
7. : the greedy method produces , exactly the scribes’ entry of question 2.
8. With denominator : , while the only larger unit fraction, , exceeds . So is the largest that fits, and
9. With denominator : , so is too big. With denominator : , so fits: it is the largest unit fraction smaller than . Then
Check: .
10. First step: and , so subtract : . Second step: is too big, and fits, so subtract : . Conclusion:
11. The numerators of the successive remainders are: for : , then ; for : , then , then ; for : , then , then . Each list is strictly decreasing.
12. The common denominator of and is :
13. Over the common denominator , the inequality compares the numerators and :
and adding to both sides gives . So after each greedy step the numerator of the remainder (question 12) is a whole number strictly smaller than the one before. Whole numbers cannot decrease strictly forever: after at most steps the remainder has numerator — a unit fraction — or is , and the method stops.
14. With the common denominator :
which is less than : the will forgot of the herd. That gap is the whole trick. Out of camels the shares , , are the whole numbers , and , which add up to : exactly the herd, and the eighteenth camel goes home. And nobody can complain: the will promised, out of camels, , then , then camels, and each child received strictly more (, and ). The forgotten is what the neighbour’s camel temporarily filled.
15. Question 4 provides the repaired will:
The shares are whole numbers when the herd size is divisible by , by and by — that is, divisible by . The smallest such herd is camels: shares , and , and nothing is left over.