1992 AHSME Problems/Problem 17
Problem
The 2-digit integers from 19 to 92 are written consecutively to form the integer . Suppose that is the highest power of 3 that is a factor of . What is ?
Solution
Solution 1
We can determine if our number is divisible by or by summing the digits. Looking at the one's place, we can start out with and continue cycling though the numbers from through . For each one of these cycles, we add . This is divisible by , thus we can ignore the sum. However, this excludes , , and . These remaining units digits sum up to , which means our units sum is . As for the tens digits, for we have sets of those: which is congruent to . We again have and , so we must add to our total. is congruent to . Thus our sum is congruent to , and .
Solution 2
As our first trial with 3, We can say that . Since if the sum of the digits of a number is divisible by 3, then the number is also divisible by 3, we reverse that logic to say that , and adding that up using the rainbow strategy, we get . We can see that since 3 divides 111, the original number is divisible by 3. But, since 111 only has one 3 and 37 has no 3's, it is not divisble by 9. Thus, the answer is
~mathpro12345
papa I wrote this second one
See also
1992 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
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 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.