Page 93 - 'Blast_Into_Math
P. 93
Blast into Math! The Euclidean algorithm: a computational recipe
The problem says, you want {a, b, c} to all be divisible by some number greater than one.
How about 2? Then, the problem also says {a, c, d} should be divisible by some number
greater than one. If a , c and d are all divisible by 2, then that means a , b , c and d are all
divisible by 2, which should not happen. So, you want a , c and d to be divisible by some
number other than 2. How about 3? Continue this way to find an a , b , c , and d which solve
the problem. There is more than one correct answer!
93
