Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A locker code is a whole number that leaves remainder when it is divided by . A second code leaves remainder when it is divided by . Nobody tells you the codes themselves.
Explain why the answers do not depend on which codes and were chosen.
Division algorithm: with , and , are unique. If and , then . To prove a fact for every integer, split into cases by the remainder.
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.
Given. and for integers and .
Plan. Expand each expression. Every term with a factor is a multiple of and does not change the remainder.
Step 1. Part (a). . Now , so the remainder is .
Step 2. Part (b). . The remainder is , since .
Step 3. Part (c). . Now , so the remainder is .
Why the codes do not matter. Only the remainders and survive in the last term. Everything else is a multiple of .
Check. Take and : leaves , and leaves .
Answer: the remainders are , and .
Watch out. The remainder of is not . Add to bring it into the range to .
Log in to join the discussion.
Loading…