Difference between revisions of "2020 AMC 10B Problems/Problem 19"
(→Solution) |
|||
Line 5: | Line 5: | ||
<math>\textbf{(A) } 2 \qquad\textbf{(B) } 3 \qquad\textbf{(C) } 4 \qquad\textbf{(D) } 6 \qquad\textbf{(E) } 7</math> | <math>\textbf{(A) } 2 \qquad\textbf{(B) } 3 \qquad\textbf{(C) } 4 \qquad\textbf{(D) } 6 \qquad\textbf{(E) } 7</math> | ||
− | ==Solution== | + | ==Solution 1== |
<math>158A00A4AA0 \equiv 1+5+8+A+0+0+A+4+A+A+0 \equiv 4A \pmod{9}</math> | <math>158A00A4AA0 \equiv 1+5+8+A+0+0+A+4+A+A+0 \equiv 4A \pmod{9}</math> | ||
Line 24: | Line 24: | ||
<math>4A\equiv8\pmod{9} \implies A=\boxed{\textbf{(A) }2}</math> ~quacker88 | <math>4A\equiv8\pmod{9} \implies A=\boxed{\textbf{(A) }2}</math> ~quacker88 | ||
+ | |||
+ | ==Solution 2== | ||
+ | <math>\binom{52}{10}=\frac{52\cdot51\cdot50\cdot49\cdot48\cdot47\cdot46\cdot45\cdot44\cdot43}{10\cdot9\cdot8\cdot7\cdot6\cdot5\cdot4\cdot3\cdot2\cdot1}=26\cdot17\cdot5\cdot7\cdot47\cdot46\cdot11\cdot43</math> | ||
+ | |||
+ | Since this number is divisible by <math>4</math> but not <math>8</math>, the last <math>2</math> digits must be divisible by <math>4</math> but the last <math>3</math> digits cannot be divisible by <math>8</math>. This narrows the options down to <math>2</math> and <math>6</math>. | ||
+ | |||
+ | Also, the number cannot be divisible by <math>3</math>. Adding up the digits, we get <math>18+4A</math>. If <math>A=6</math>, then the expression equals <math>42</math>, a multiple of <math>3</math>. This would mean that the entire number would be divisible by <math>3</math>, which is not what we want. Therefore, the only option is <math>\boxed{\textbf{(A) }2}</math>-PCChess | ||
==See Also== | ==See Also== |
Revision as of 16:44, 7 February 2020
Contents
Problem
In a certain card game, a player is dealt a hand of cards from a deck of distinct cards. The number of distinct (unordered) hands that can be dealt to the player can be written as . What is the digit ?
Solution 1
We're looking for the amount of ways we can get cards from a deck of , which is represented by .
We need to get rid of the multiples of , which will subsequently get rid of the multiples of (if we didn't, the zeroes would mess with the equation since you can't divide by 0)
, , leaves us with 17.
Converting these into, we have
~quacker88
Solution 2
Since this number is divisible by but not , the last digits must be divisible by but the last digits cannot be divisible by . This narrows the options down to and .
Also, the number cannot be divisible by . Adding up the digits, we get . If , then the expression equals , a multiple of . This would mean that the entire number would be divisible by , which is not what we want. Therefore, the only option is -PCChess
See Also
2020 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 18 |
Followed by Problem 20 | |
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.