Difference between revisions of "2010 AMC 12B Problems/Problem 11"
Sharkyman15 (talk | contribs) m (→Addendum (Alternate)) |
|||
(10 intermediate revisions by 8 users not shown) | |||
Line 1: | Line 1: | ||
− | == Problem | + | {{duplicate|[[2010 AMC 12B Problems|2010 AMC 12B #11]] and [[2010 AMC 10B Problems|2010 AMC 10B #21]]}} |
+ | |||
+ | == Problem == | ||
A palindrome between <math>1000</math> and <math>10,000</math> is chosen at random. What is the probability that it is divisible by <math>7</math>? | A palindrome between <math>1000</math> and <math>10,000</math> is chosen at random. What is the probability that it is divisible by <math>7</math>? | ||
<math>\textbf{(A)}\ \dfrac{1}{10} \qquad \textbf{(B)}\ \dfrac{1}{9} \qquad \textbf{(C)}\ \dfrac{1}{7} \qquad \textbf{(D)}\ \dfrac{1}{6} \qquad \textbf{(E)}\ \dfrac{1}{5}</math> | <math>\textbf{(A)}\ \dfrac{1}{10} \qquad \textbf{(B)}\ \dfrac{1}{9} \qquad \textbf{(C)}\ \dfrac{1}{7} \qquad \textbf{(D)}\ \dfrac{1}{6} \qquad \textbf{(E)}\ \dfrac{1}{5}</math> | ||
− | == Solution == | + | == Solution 1== |
View the palindrome as some number with form (decimal representation): | View the palindrome as some number with form (decimal representation): | ||
<math>a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0</math>. But because the number is a palindrome, <math>a_3 = a_0, a_2 = a_1</math>. Recombining this yields <math>1001a_3 + 110a_2</math>. 1001 is divisible by 7, which means that as long as <math>a_2 = 0</math>, the palindrome will be divisible by 7. This yields 9 palindromes out of 90 (<math>9 \cdot 10</math>) possibilities for palindromes. However, if <math>a_2 = 7</math>, then this gives another case in which the palindrome is divisible by 7. This adds another 9 palindromes to the list, bringing our total to <math>18/90 = \boxed {\frac{1}{5} } = \boxed {E}</math> | <math>a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0</math>. But because the number is a palindrome, <math>a_3 = a_0, a_2 = a_1</math>. Recombining this yields <math>1001a_3 + 110a_2</math>. 1001 is divisible by 7, which means that as long as <math>a_2 = 0</math>, the palindrome will be divisible by 7. This yields 9 palindromes out of 90 (<math>9 \cdot 10</math>) possibilities for palindromes. However, if <math>a_2 = 7</math>, then this gives another case in which the palindrome is divisible by 7. This adds another 9 palindromes to the list, bringing our total to <math>18/90 = \boxed {\frac{1}{5} } = \boxed {E}</math> | ||
+ | |||
+ | == Solution (Divisibility Rules) == | ||
+ | |||
+ | We can notice the palindrome is of the form <math>\overline{abba}</math>. Then, by the divisibility rule of <math>7</math>, <math>7</math> must divide <cmath>100a+11b-2a = 98a+11b.</cmath> This nicely simplifies to the fact that <math>7 \mid 4b,</math> so <math>b</math> is clearly <math>0</math> or <math>7</math>. This gives us <math>9 \cdot 2</math> total choices for the palindrome divisible by <math>7</math>, divided by <math>9 \cdot 10</math> total choices for <math>\overline{abba}</math>, giving us an answer of <math>\boxed{\text{(E)}} \ \dfrac{1}{5}</math>. | ||
+ | |||
+ | ~icecreamrolls8 | ||
== Addendum (Alternate) == | == Addendum (Alternate) == | ||
− | <math>7\mid 1001a^3+110b^2</math> and <math>1001 \equiv 0 | + | <math>7\mid 1001a^3+110b^2</math> and <math>1001 \equiv 0 \pmod 7</math>. Knowing that <math>a</math> does not factor (pun intended) into the problem, note 110's prime factorization and <math>7\mid b</math>. There are only 10 possible digits for <math>b</math>, 0 through 9, but <math>7\mid b</math> only holds if <math>b=0, 7</math>. This is 2 of the 10 digits, so <math>\frac{2}{10}=\boxed{\textbf{(E) }\frac{1}{5}}</math> |
~BJHHar | ~BJHHar | ||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/ZfnxbpdFKjU | ||
+ | |||
+ | ~IceMatrix | ||
+ | |||
== See also == | == See also == | ||
{{AMC12 box|year=2010|num-b=10|num-a=12|ab=B}} | {{AMC12 box|year=2010|num-b=10|num-a=12|ab=B}} | ||
+ | {{AMC10 box|year=2010|num-b=20|num-a=22|ab=B}} | ||
[[Category:Introductory Combinatorics Problems]] | [[Category:Introductory Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 17:58, 22 June 2024
- The following problem is from both the 2010 AMC 12B #11 and 2010 AMC 10B #21, so both problems redirect to this page.
Contents
Problem
A palindrome between and is chosen at random. What is the probability that it is divisible by ?
Solution 1
View the palindrome as some number with form (decimal representation): . But because the number is a palindrome, . Recombining this yields . 1001 is divisible by 7, which means that as long as , the palindrome will be divisible by 7. This yields 9 palindromes out of 90 () possibilities for palindromes. However, if , then this gives another case in which the palindrome is divisible by 7. This adds another 9 palindromes to the list, bringing our total to
Solution (Divisibility Rules)
We can notice the palindrome is of the form . Then, by the divisibility rule of , must divide This nicely simplifies to the fact that so is clearly or . This gives us total choices for the palindrome divisible by , divided by total choices for , giving us an answer of .
~icecreamrolls8
Addendum (Alternate)
and . Knowing that does not factor (pun intended) into the problem, note 110's prime factorization and . There are only 10 possible digits for , 0 through 9, but only holds if . This is 2 of the 10 digits, so
~BJHHar
Video Solution
~IceMatrix
See also
2010 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 10 |
Followed by Problem 12 |
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 12 Problems and Solutions |
2010 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 20 |
Followed by Problem 22 | |
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.