Difference between revisions of "2023 AMC 10A Problems/Problem 12"
m (→Solution 1) |
(Added See Also and added latex for Solution 2) |
||
Line 1: | Line 1: | ||
+ | ==Problem== | ||
How many three-digit positive integers <math>N</math> satisfy the following properties? | How many three-digit positive integers <math>N</math> satisfy the following properties? | ||
Line 24: | Line 25: | ||
We then use modular arithmetic: | We then use modular arithmetic: | ||
− | + | <cmath>\begin{align*} | |
+ | 0&\equiv N \:(\text{mod }7)\\ | ||
+ | &\equiv500+10a+b\:(\text{mod }7)\\ | ||
+ | &\equiv3+3a+b\:(\text{mod }7)\\ | ||
+ | 3a+b&\equiv-3\:(\text{mod }7)\\ | ||
+ | &\equiv4\:(\text{mod }7)\\ | ||
+ | \end{align*}</cmath> | ||
We know that <math>0\le a,b<10</math>. We then look at each possible value of <math>a</math>: | We know that <math>0\le a,b<10</math>. We then look at each possible value of <math>a</math>: | ||
Line 49: | Line 56: | ||
Each of these cases are unique, so there are a total of <math>1+2+1+2+1+1+2+1+2+1=\boxed{\text{(B) }14.}</math> | Each of these cases are unique, so there are a total of <math>1+2+1+2+1+1+2+1+2+1=\boxed{\text{(B) }14.}</math> | ||
+ | ==See Also== | ||
+ | {{AMC10 box|year=2023|ab=A|num-b=11|num-a=13}} | ||
+ | {{MAA Notice}} |
Revision as of 20:18, 9 November 2023
Contents
Problem
How many three-digit positive integers satisfy the following properties?
- The number is divisible by .
- The number formed by reversing the digits of is divisble by .
Solution 1
Multiples of always end in or and since it is a three-digit number (otherwise it would be a two-digit number), it cannot start with 0. All possibilities have to be in the range from to inclusive.
. .
~walmartbrian ~Shontai ~andliu766 ~andyluo
Solution 2 (solution 1 but more thorough + alternate way)
Let We know that is divisible by , so is either or . However, since is the first digit of the three-digit number , it can not be , so therefore, . Thus, There are no further restrictions on digits and aside from being divisible by .
The smallest possible is . The next smallest is , then , and so on, all the way up to . Thus, our set of possible is . Dividing by for each of the terms will not affect the cardinality of this set, so we do so and get . We subtract from each of the terms, again leaving the cardinality unchanged. We end up with , which has a cardinality of . Therefore, our answer is
Alternate solution:
We first proceed as in the above solution, up to . We then use modular arithmetic:
We know that . We then look at each possible value of :
If , then must be .
If , then must be or .
If , then must be .
If , then must be or .
If , then must be .
If , then must be .
If , then must be or .
If , then must be .
If , then must be or .
If , then must be .
Each of these cases are unique, so there are a total of
See Also
2023 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
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.