2005 AMC 12B Problems/Problem 21

Problem

A positive integer $n$ has $60$ divisors and $7n$ has $80$ divisors. What is the greatest integer $k$ such that $7^k$ divides $n$ ?

$\mathrm{(A)}\ {{{0}}} \qquad \mathrm{(B)}\ {{{1}}} \qquad \mathrm{(C)}\ {{{2}}} \qquad \mathrm{(D)}\ {{{3}}} \qquad \mathrm{(E)}\ {{{4}}}$

Solution

If $n$ has $60$ factors, then $n$ is a product of $2\times2\times3\times5$ powers of (not necessarily distinct) primes. When multiplied by $7$ , the amount of factors of $n$ increased by $\frac{80}{60}=\frac{4}{3}$ , so there are $4$ possible powers of $7$ in the factorization of $7n$ , and $3$ possible powers of $7$ in the factorization of $n$ , which would be $7^0$ , $7^1$ , and $7^2$ . Therefore the highest power of $7$ that could divide $n$ is $2\Rightarrow\boxed{C}$ .

Page

Toolbox

Search

2005 AMC 12B Problems/Problem 21

Problem

Solution

See also