Difference between revisions of "2023 AMC 10A Problems/Problem 12"
Technodoggo (talk | contribs) |
|||
Line 11: | Line 11: | ||
~walmartbrian ~Shontai ~andliu766 | ~walmartbrian ~Shontai ~andliu766 | ||
+ | |||
+ | ==Solution 2 (solution 1 but more thorough + alternate way)== | ||
+ | Let <math>N=\overline{cab}=100c+10a+b.</math> We know that <math>\overline{bac}</math> is divisible by <math>5</math>, so <math>c</math> is either <math>0</math> or <math>5</math>. However, since <math>c</math> is the first digit of the three-digit number <math>N</math>, it can not be <math>0</math>, so therefore, <math>c=5</math>. Thus, <math>N=\overline{5ab}=500+10a+b.</math> There are no further restrictions on digits <math>a</math> and <math>b</math> aside from <math>N</math> being divisible by <math>7</math>. | ||
+ | |||
+ | The smallest possible <math>N</math> is <math>504</math>. The next smallest <math>N</math> is <math>511</math>, then <math>518</math>, and so on, all the way up to <math>595</math>. Thus, our set of possible <math>N</math> is <math>\{504,511,518,\dots,595\}</math>. Dividing by <math>7</math> for each of the terms will not affect the cardinality of this set, so we do so and get <math>\{72,73,74,\dots,85\}</math>. We subtract <math>71</math> from each of the terms, again leaving the cardinality unchanged. We end up with <math>\{1,2,3,\cdots,14\}</math>, which has a cardinality of <math>14</math>. Therefore, our answer is <math>\boxed{\text{(B) }14.}</math> | ||
+ | |||
+ | Alternate solution: | ||
+ | |||
+ | We first proceed as in the above solution, up to <math>N=500+10a+b</math>. | ||
+ | We then use modular arithmetic: | ||
+ | |||
+ | \begin{align*} | ||
+ | 0&\equiv N~(\mod7) \\ | ||
+ | &\equiv500+10a+b~(\mod7) \\ | ||
+ | &\equiv3+3a+b~(\mod7) \\ | ||
+ | 3a+b&\equiv-3~(\mod7) \\ | ||
+ | &\equiv4~(\mod7). \\ | ||
+ | \end{align*} | ||
+ | |||
+ | We know that <math>0\le a,b<10</math>. We then look at each possible value of <math>a</math>: | ||
+ | |||
+ | If <math>a=0</math>, then <math>b</math> must be <math>4</math>. | ||
+ | |||
+ | If <math>a=1</math>, then <math>b</math> must be <math>1</math> or <math>8</math>. | ||
+ | |||
+ | If <math>a=2</math>, then <math>b</math> must be <math>5</math>. | ||
+ | |||
+ | If <math>a=3</math>, then <math>b</math> must be <math>2</math> or <math>9</math>. | ||
+ | |||
+ | If <math>a=4</math>, then <math>b</math> must be <math>6</math>. | ||
+ | |||
+ | If <math>a=5</math>, then <math>b</math> must be <math>3</math>. | ||
+ | |||
+ | If <math>a=6</math>, then <math>b</math> must be <math>0</math> or <math>7</math>. | ||
+ | |||
+ | If <math>a=7</math>, then <math>b</math> must be <math>4</math>. | ||
+ | |||
+ | If <math>a=8</math>, then <math>b</math> must be <math>1</math> or <math>8</math>. | ||
+ | |||
+ | If <math>a=9</math>, then <math>b</math> must be <math>5</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> |
Revision as of 19:21, 9 November 2023
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 5 always end in 0 or 5 and since it is a three digit number, it cannot start with 0. All possibilities have to be in the range from 7 x 72 to 7 x 85 inclusive. 85 - 72 + 1 = 14. .
~walmartbrian ~Shontai ~andliu766
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:
\begin{align*} 0&\equiv N~(\mod7) \\ &\equiv500+10a+b~(\mod7) \\ &\equiv3+3a+b~(\mod7) \\ 3a+b&\equiv-3~(\mod7) \\ &\equiv4~(\mod7). \\ \end{align*}
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