Difference between revisions of "2001 APMO Problems/Problem 1"
Psycho2548 (talk | contribs) (Created page with "Thanks.") |
Aidensharp (talk | contribs) |
||
Line 1: | Line 1: | ||
− | + | For any positive integer <math>n</math>, let <math>S(n)</math> be the sum of digits in the decimal representation of <math>n</math>. Any positive integer obtained by removing one or more digits from the right end of the decimal representation of <math>n</math> is called a stump of <math>n</math>. Let <math>T(n)</math> be the sum of all stumps of <math>n</math>. Prove that <math>n = S(n) + 9T(n)</math>. (For example, if <math>n = 238</math>, we have <math>S(n) = 2+3+8 = 13</math>, and stumps <math>2</math> and <math>23</math>, so <math>T(n) = 2+23 = 25</math>. We verify that <math>238 = 13 + 9(25)</math>.) |
Latest revision as of 21:57, 25 October 2022
For any positive integer , let be the sum of digits in the decimal representation of . Any positive integer obtained by removing one or more digits from the right end of the decimal representation of is called a stump of . Let be the sum of all stumps of . Prove that . (For example, if , we have , and stumps and , so . We verify that .)