Maths Olympiad Prep

Library / CEMC Fryer /68 of 89

CEMC Fryer, 2007

Number theory Difficulty 3.0 AMC 10/12 Prove it Canada

A number is divisible by 9 if the sum of its digits is divisible by 9. For example, the number 19 83619\,836 is divisible by 9 but 19 82519\,825 is not. If D 767 E89D\,767\,E89 is divisible by 9, where DD and EE each represent a single digit, what are the possible values of the sum D+ED + E? Explain how you obtained your answer.

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.
Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.