olymmath

APMO 2001 Problem 1

  • Paper

For a positive integer nn let S(n)S(n) be the sum of digits in the decimal representation of nn . Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of nn is called a stump of nn . Let T(n)T(n) be the sum of all stumps of nn . Prove that n=S(n)+9T(n)n=S(n)+9T(n) .

Dataset text AI-MO AoPS. 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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator apmo/2001/p1 · Tag N6H4Y9NV8C · Edit this page on GitHub · Keys: j next, k previous