Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A machine can print only the digits and . You want it to print a positive multiple of , and you want the smallest one it can print.
A number and its digit sum leave the same remainder on division by . A number and its alternating sum leave the same remainder on division by . The last digits decide divisibility by and . Also .
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.
Plan. Use . One rule fixes the end of the number, the other fixes how many s it has.
Step 1. Part (a). A number is a multiple of exactly when its last two digits are , , or . With only and available, the ending must be .
Step 2. Part (b). The digit sum is the number of s. It must be a multiple of , and it is not , so there are at least nine s.
Step 3. Part (c). The number has at least digits. Among numbers of digits, a smaller one has a earlier. But every one of the first nine places must hold a , because the last two places are . So the only -digit candidate is .
Step 4. Check it. Its digit sum is and it ends in , so it is divisible by and by , hence by . Indeed .
Answer: , with digits, of them equal to . Proof complete.
Log in to join the discussion.
Loading…