2019 AMC 10B Problems/Problem 14: Difference between revisions
| Line 2: | Line 2: | ||
The base-ten representation for <math>19!</math> is <math>121,6T5,100,40M,832,H00</math>, where <math>T</math>, <math>M</math>, and <math>H</math> denote digits that are not given. What is <math>T+M+H</math>? | The base-ten representation for <math>19!</math> is <math>121,6T5,100,40M,832,H00</math>, where <math>T</math>, <math>M</math>, and <math>H</math> denote digits that are not given. What is <math>T+M+H</math>? | ||
==Solution== | ==Solution 1== | ||
We can figure out <math>H = 0</math> by noticing that <math>19!</math> will end with <math>3</math> zeroes, as there are three <math>5</math>'s in its prime factorization. Next we use the fact that <math>19!</math> is a multiple of both <math>11</math> and <math>9</math>. Since their divisibility rules gives us that <math>T + M</math> is congruent to <math>3</math> mod <math>9</math> and that <math>T - M</math> is congruent to <math>7</math> mod <math>11</math>. By inspection, we see that <math>T = 4, M = 8</math> is a valid solution. Therefore the answer is <math>4 + 8 + 0 = 12</math>, which is (C). | We can figure out <math>H = 0</math> by noticing that <math>19!</math> will end with <math>3</math> zeroes, as there are three <math>5</math>'s in its prime factorization. Next we use the fact that <math>19!</math> is a multiple of both <math>11</math> and <math>9</math>. Since their divisibility rules gives us that <math>T + M</math> is congruent to <math>3</math> mod <math>9</math> and that <math>T - M</math> is congruent to <math>7</math> mod <math>11</math>. By inspection, we see that <math>T = 4, M = 8</math> is a valid solution. Therefore the answer is <math>4 + 8 + 0 = 12</math>, which is (C). | ||
Revision as of 01:21, 15 February 2019
Problem
The base-ten representation for
is
, where
,
, and
denote digits that are not given. What is
?
Solution 1
We can figure out
by noticing that
will end with
zeroes, as there are three
's in its prime factorization. Next we use the fact that
is a multiple of both
and
. Since their divisibility rules gives us that
is congruent to
mod
and that
is congruent to
mod
. By inspection, we see that
is a valid solution. Therefore the answer is
, which is (C).
Solution 2
We can manually calculate 19!. If we prime factorize 19!, it becomes
. This looks complicated, but we can use elimination methods to make it simpler.
, and
. If we put these aside for a moment, we have
.
, and
. We have the 2's and 3's out of the way, and then we have
. Now if we multiply all the values calculated, we get
. Thus
, and the answer
, thus (C).
See Also
| 2019 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 13 |
Followed by Problem 15 | |
| 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 | ||
These problems are copyrighted © by the Mathematical Association of America.