Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A cook has a -litre jug, an -litre jug, a tap and a large pot. She fills the small jug at the tap and empties it into the pot. She also fills the large jug from the pot and pours it away. She wants exactly litre to end up in the pot.
Euclidean algorithm: where . Bezout: for some integers , , and is solvable exactly when .
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Part (a). Each pour into the pot adds litres. Each removal takes out litres. After pours and removals the pot holds litres.
Step 2. Part (b). We need to be more than a multiple of . The values for are . Their remainders on division by are . So , and gives .
Step 3. Part (c). Every amount is , a multiple of . So litre is impossible. This is Bezout's condition: is not a multiple of .
Answer: fills of the -litre jug in, fills of the -litre jug out; with jugs of and litres only multiples of litres are possible. Proof complete.
Watch out. The pot needs room for the litres before the removals start, or the steps must be mixed. Only the totals matter for the count.
Log in to join the discussion.
Loading…