Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2015 AIME II Problems/Problem 3"

(→‎Solution 1)
(→‎Solution 1)
Line 34: Line 34:
  
 
Thus the answer is <math>\boxed{476}</math>.
 
Thus the answer is <math>\boxed{476}</math>.
 +
 +
==Solution 2==
 +
 +
The digit sum of a base <math>10</math> integer <math>m</math> is just <math>m\pmod{9}</math>. In this problem, we know <math>17\mid m</math>, or <math>m=17k</math> for a positive integer <math>k</math>.
 +
 +
Also, we know that <math>m\equiv 17\equiv -1\pmod{9}</math>, or <math>17k\equiv -k\equiv -1\pmod{9}</math>.
 +
 +
Obviously <math>k=1</math> is a solution. This means in general, <math>k=9x+1</math> is a solution for non-negative integer <math>x</math>.
 +
 +
Checking the first few possible solutions, we find that <math>m=\boxed{476}</math> is the first solution that has <math>s(m)=17</math>, and we're done.
  
 
== See also ==  
 
== See also ==  
 
{{AIME box|year=2015|n=II|num-b=2|num-a=4}} {{MAA Notice}}
 
{{AIME box|year=2015|n=II|num-b=2|num-a=4}} {{MAA Notice}}

Revision as of 14:05, 26 March 2015

Problem

Let $m$ be the least positive integer divisible by $17$ whose digits sum to $17$. Find $m$.

Solution 1

The three-digit integers divisible by $17$, and their digit sum: \[\begin{array}{c|c} m & s(m)\\ \hline 102 & 3 \\ 119 & 11\\ 136 & 10\\ 153 & 9\\ 170 & 8\\ 187 & 16\\ 204 & 6\\ 221 & 5\\ 238 & 13\\ 255 & 12\\ 272 & 11\\ 289 & 19\\ 306 & 9\\ 323 & 8\\ 340 & 7\\ 357 & 15\\ 374 & 14\\ 391 & 13\\ 408 & 12\\ 425 & 11\\ 442 & 10\\ 459 & 18\\ 476 & 17 \end{array}\]

Thus the answer is $\boxed{476}$.

Solution 2

The digit sum of a base $10$ integer $m$ is just $m\pmod{9}$. In this problem, we know $17\mid m$, or $m=17k$ for a positive integer $k$.

Also, we know that $m\equiv 17\equiv -1\pmod{9}$, or $17k\equiv -k\equiv -1\pmod{9}$.

Obviously $k=1$ is a solution. This means in general, $k=9x+1$ is a solution for non-negative integer $x$.

Checking the first few possible solutions, we find that $m=\boxed{476}$ is the first solution that has $s(m)=17$, and we're done.

See also

2015 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_AIME_II_Problems/Problem_3&oldid=69499"