1965 AHSME Problems/Problem 33: Difference between revisions
m Put a {} around 11 |
Tecilis459 (talk | contribs) Add problem statement |
||
| Line 1: | Line 1: | ||
==Solution== | == Problem == | ||
If the number <math>15!</math>, that is, <math>15 \cdot 14 \cdot 13 \dots 1</math>, ends with <math>k</math> zeros when given to the base <math>12</math> and ends with <math>h</math> zeros | |||
when given to the base <math>10</math>, then <math>k + h</math> equals: | |||
<math>\textbf{(A)}\ 5 \qquad | |||
\textbf{(B) }\ 6 \qquad | |||
\textbf{(C) }\ 7 \qquad | |||
\textbf{(D) }\ 8 \qquad | |||
\textbf{(E) }\ 9 </math> | |||
== Solution == | |||
We can use Legendre's to find the number of <math>0</math>s in base <math>10</math> | We can use Legendre's to find the number of <math>0</math>s in base <math>10</math> | ||
<cmath>\lfloor \frac{15}{5} \rfloor + \lfloor \frac{15}{25} \rfloor = 3</cmath> | <cmath>\lfloor \frac{15}{5} \rfloor + \lfloor \frac{15}{25} \rfloor = 3</cmath> | ||
Revision as of 12:54, 16 July 2024
Problem
If the number
, that is,
, ends with
zeros when given to the base
and ends with
zeros
when given to the base
, then
equals:
Solution
We can use Legendre's to find the number of
s in base
So
.
Likewise, we are looking for the number of
s and
s that divide
, so we use Legendre's again.
Thus,
and
So
, and
~JustinLee2017