RU-ALLRUSSIAN 1982 Problem 3
N is a sum of n powers of 2. If N is divisible by , prove that . Does there exist a number divisible by 11...1 (m 1s) which has the sum of its digits less than m?
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.