Chapter 29
Solutions for eighth week’s assignments

Also available as PDF.

29.1 Exercises 5.3

Problem 62
If (p,q) = p, then p\mathrel{∣}q and q is a multiple of p.
Problem 66
We want the least common multiple of 6 and 10. The nights off intersect every 30 days. July has 31 days, so by this method their next shared day off is the 31st. On the “trick question” side, though, they may have July 4th off together\mathop{\mathop{…}}
Problem 70
Here we need the greatest common divisor, (60,72) = 12. So the longest common length is 1 foot.

29.2 Computing GCDs

Compute the following using both the prime factorization method and the Euclidean algorithm:

Prime factorizations:

Euclidean algorithm:

29.3 Computing LCMs

Compute the least common multiples: