Art of Problem Solving

2015 AIME I Problems/Problem 8: Difference between revisions

Pieater314159 (talk | contribs)
Created page with "==Problem== For positive integer <math>n</math>, let <math>s(n)</math> denote the sum of the digits of <math>n</math>. Find the smallest positive integer satisfying <math>s(..."
 
Pieater314159 (talk | contribs)
Line 2: Line 2:


For positive integer <math>n</math>, let <math>s(n)</math> denote the sum of the digits of <math>n</math>.  Find the smallest positive integer satisfying <math>s(n) = s(n+864) = 20</math>.
For positive integer <math>n</math>, let <math>s(n)</math> denote the sum of the digits of <math>n</math>.  Find the smallest positive integer satisfying <math>s(n) = s(n+864) = 20</math>.
==Solution==

Revision as of 11:41, 20 March 2015

Problem

For positive integer $n$, let $s(n)$ denote the sum of the digits of $n$. Find the smallest positive integer satisfying $s(n) = s(n+864) = 20$.

Solution