Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2005 AMC 12B Problems/Problem 21"
(→‎Solution)
 
(2 intermediate revisions by 2 users not shown)
Line 5: Line 5:
  
 
== Solution ==
 
== Solution ==
−
If <math>n</math> has <math>60</math> factors, then <math>n</math> is a product of <math>2\times2\times3\times5</math> powers of (not necessarily distinct) primes. When multiplied by <math>7</math>, the amount of factors of <math>n</math> increased by <math>\frac{80}{60}=\frac{4}{3}</math>, so there are <math>4</math> possible powers of <math>7</math> in the factorization of <math>7n</math>, and <math>3</math> possible powers of <math>7</math> in the factorization of <math>n</math>, which would be <math>7^0</math>, <math>7^1</math>, and <math>7^2</math>. Therefore the highest power of <math>7</math> that could divide <math>n</math> is <math>2\Rightarrow\boxed{C}</math>.
+
We may let <math>n = 7^k \cdot m</math>, where <math>m</math> is not divisible by 7. Using the fact that the number of divisors function <math>d(n)</math> is multiplicative, we have <math>d(n) = d(7^k)d(m) = (k+1)d(m) = 60</math>. Also, <math>d(7n) = d(7^{k+1})d(m) = (k+2)d(m) = 80</math>. These numbers are in the ratio 3:4, so <math>\frac{k+1}{k+2} = \frac{3}{4} \implies k = 2 \Rightarrow \boxed{\mathrm{C}}</math>.
  
 
== See also ==
 
== See also ==
 
{{AMC12 box|year=2005|ab=B|num-b=20|num-a=22}}
 
{{AMC12 box|year=2005|ab=B|num-b=20|num-a=22}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 19:04, 24 December 2020

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

We may let $n = 7^k \cdot m$, where $m$ is not divisible by 7. Using the fact that the number of divisors function $d(n)$ is multiplicative, we have $d(n) = d(7^k)d(m) = (k+1)d(m) = 60$. Also, $d(7n) = d(7^{k+1})d(m) = (k+2)d(m) = 80$. These numbers are in the ratio 3:4, so $\frac{k+1}{k+2} = \frac{3}{4} \implies k = 2 \Rightarrow \boxed{\mathrm{C}}$.

See also

2005 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 20 		Followed by
Problem 22
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 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_AMC_12B_Problems/Problem_21&oldid=140526"