Difference between revisions of "2017 AMC 10A Problems/Problem 25"
m (→Solution 2) |
Maxtplusamsp (talk | contribs) m (→Solution 1) |
||
Line 25: | Line 25: | ||
<math>\textbf{Part 2}</math>: <math>B>0</math> | <math>\textbf{Part 2}</math>: <math>B>0</math> | ||
− | <math>B=1, A=C | + | <math>B=1, A+1=C</math>, this case results in 121, 231,... 891. There are <math>6</math> ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to <math>45</math> cases. |
− | <math>\textbf{Part 3}</math>: <math>B=2, A=C | + | <math>\textbf{Part 3}</math>: <math>B=2, A+2=C</math>, this case results in 242, 352,... 792. There are <math>6</math> ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to <math>33</math> cases. |
− | <math>\textbf{Part 4}</math>: <math>B=3, A=C | + | <math>\textbf{Part 4}</math>: <math>B=3, A+3=C</math>, this case results in 363, 473,...693. There are <math>6</math> ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to <math>21</math> cases. |
− | <math>\textbf{Part 5}</math>: <math>B=4, A=C | + | <math>\textbf{Part 5}</math>: <math>B=4, A+4=C</math>, this case results in 484 and 594. There are <math>6</math> ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to <math>9</math> cases. |
Revision as of 20:25, 8 February 2017
Contents
Problem
How many integers between and
, inclusive, have the property that some permutation of its digits is a multiple of
between
and
For example, both
and
have this property.
Solution 1
Let the three-digit number be :
If a number is divisible by , then the difference between the sums of alternating digits is a multiple of
.
There are two cases:
and
We now proceed to break down the cases.
:
. This has
cases.
:
, this case results in 110, 220, 330...990. There are two ways to arrange the digits in each of those numbers.
:
, this case results in 121, 231,... 891. There are
ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to
cases.
:
, this case results in 242, 352,... 792. There are
ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to
cases.
:
, this case results in 363, 473,...693. There are
ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to
cases.
:
, this case results in 484 and 594. There are
ways to arrange the digits in all of those number except the first, and 3 ways ways for the first. This leads to
cases.
:
.
:
, this cases results in 209, 308, ...506. There are
ways to arrange each of those cases. This leads to
cases.
:
, this cases results in 319, 418, ...616. There are
ways to arrange each of those cases, except the last. This leads to
cases.
:
, this cases results in 429, 528, ...617. There are
ways to arrange each of those cases. This leads to
cases.
...
If you continue this counting, you receive cases.
Solution 2
We note that we only have to consider multiples of 11 and see how many valid permutations each has. We can do casework on the number of repeating digits that the multiple of 11 has:
All three digits are the same.
By inspection, we find that there are no multiples of 11 here.
Two of the digits are the same, and the third is different.
There are 8 multiples of 11 without a zero that have this property:
121, 242, 363. 484, 616, 737, 858, 979.
Each contributes 3 valid permutations, so there are
permutations in this subcase.
There are 9 multiples of 11 with a zero that have this property:
110, 220, 330, 440, 550, 660, 770, 880, 990.
Each one contributes 2 valid permutations (the first digit can't be zero), so there are
permutations in this subcase.
All the digits are different.
Since there are
multiples of 11 between 100 and 999, there are
multiples of 11 remaining in this case. However, 8 of them contain a zero, namely 209, 308, 407, 506, 605, 704, 803, and 902. Each of those multiples of 11 contributes
valid permutations, but we overcounted by a factor of 2; every permutation of 209, for example, is also a permutation of 902. Therefore, there are
. Therefore, there are
remaining multiples of 11 without a 0 in this case. Each one contributes
valid permutations, but once again, we overcounted by a factor of 2 (note that if a number ABC is a multiple of 11, then so is CBA). Therefore, there are
valid permutations in this subcase.
Adding up all the permutations from all the cases, we have .
See Also
2017 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last Problem | |
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.