Classic olympiad problem · Number Theory
Prove that a positive integer N is divisible by 9 if and only if the…
Prove that a positive integer is divisible by if and only if the sum of its digits is divisible by .
This is a proof problem. The answer is an argument, not a number. The solution is deliberately not posted here: reading a solution you didn't fight for teaches almost nothing. On Lemma you attempt it cold, take one of the 3 progressive hints only when genuinely stuck, then compare your proof against a full walkthrough and mark yourself with the same rubric a competition coordinator would use.
Guides that use this problem
- How many practice problems should you do a day?The daily count is the wrong target. How to size a practice session from your miss rate and review time, and why a mixed set beats a bigger one.
- How to check an answer when the clock is against youRe-reading your working reproduces the error that made it. Five checks that are independent of the derivation, and the order to run them under time pressure.
- Which modulus? The real trick in competition number theoryModular arithmetic tricks are one decision wearing many hats: which modulus. The residue table, how to read the modulus off the problem, and when it fails.
Train it on Lemma
This problem sits in the Olympiad Set: 89 proof problems (real IMO problems and the classics) with progressive hints, full walkthroughs and marking rubrics. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your levelMore Number Theory problems
- IMO 1959, Problem 1IMO 1959, Problem 1 · difficulty 3/6
- IMO 1988, Problem 6IMO 1988, Problem 6 · difficulty 6/6
- EuclidClassic (Euclid) · difficulty 2/6
- All 89 problems →