Difference between revisions of "2007 AMC 10B Problems/Problem 24"
(→Solution) |
|||
| Line 16: | Line 16: | ||
{{AMC10 box|year=2007|ab=B|num-b=23|num-a=25}} | {{AMC10 box|year=2007|ab=B|num-b=23|num-a=25}} | ||
| + | {{MAA Notice}} | ||
Revision as of 11:23, 4 July 2013
Problem
Let 
denote the smallest positive integer that is divisible by both 
and 
and whose base-
representation consists of only 's and 
's, with at least one of each. What are the last four digits of 
Solution
For a number to be divisible by 
the last two digits have to be divisible by 
That means the last two digits of this integer must be
For a number to be divisible by the sum of all the digits must be divisible by 
The only way to make this happen is with 9 's. However, we also need one
The smallest integer that meets all these conditions is 
. The last four digits are 
See Also
| 2007 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 23 |
Followed by Problem 25 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
