Art of Problem Solving

2005 AMC 12B Problems/Problem 21: Difference between revisions

YottaByte (talk | contribs)
mNo edit summary
Jhggins (talk | contribs)
Line 1: Line 1:
{{empty}}
{{empty}}
== Problem ==
== Problem ==
{{problem}}
A positive integer <math>n</math> has <math>60</math> divisors and <math>7n</math> has <math>80</math> divisors.  What is the greatest integer <math>k</math> such that <math>7^k</math> divides <math>n</math>?
 
<math>\mathrm{(A)}\ {{{0}}} \qquad \mathrm{(B)}\ {{{1}}} \qquad \mathrm{(C)}\ {{{2}}} \qquad \mathrm{(D)}\ {{{3}}} \qquad \mathrm{(E)}\ {{{4}}}</math>
 
== Solution ==
== Solution ==


== See also ==
== See also ==
* [[2005 AMC 12B Problems]]
* [[2005 AMC 12B Problems]]

Revision as of 13:51, 4 February 2011

This is an empty template page which needs to be filled. You can help us out by finding the needed content and editing it in. Thanks.

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

See also