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 "2010 AMC 12B Problems/Problem 25"

(→‎Solution)
m
Line 14: Line 14:
 
== Solution ==  
 
== Solution ==  
 
Because 67 is the largest prime factor of 2010, it means that in the prime factorization of <math>\prod_{n=2}^{5300}\text{pow}(n)</math>, there'll be <math>p_1 ^{e_1} \cdot p_2 ^{e_2} \cdot .... 67^x ...</math> where <math>x</math> is the desired value we are looking for. Thus, to find this answer, we need to look for the number of times 67 would be incorporated into the giant product.  
 
Because 67 is the largest prime factor of 2010, it means that in the prime factorization of <math>\prod_{n=2}^{5300}\text{pow}(n)</math>, there'll be <math>p_1 ^{e_1} \cdot p_2 ^{e_2} \cdot .... 67^x ...</math> where <math>x</math> is the desired value we are looking for. Thus, to find this answer, we need to look for the number of times 67 would be incorporated into the giant product.  
−
Any number of the form <math>x \cdot 67</math> would fit this form. However, this number tops at <math>71 = x</math> because 71 is a higher prime than 67. <math>67^2</math> itself must be counted twice because it's counted twice as a squared number. Any non-prime number that's less than 79 (and greater than 71) can be counted, and this totals 5. Thus, <math>71 + 1 + 5 = \boxed{77} \Righarrow \boxed{D}</math>
+
Any number of the form <math>x \cdot 67</math> would fit this form. However, this number tops at <math>71 = x</math> because 71 is a higher prime than 67. <math>67^2</math> itself must be counted twice because it's counted twice as a squared number. Any non-prime number that's less than 79 (and greater than 71) can be counted, and this totals 5. Thus, <math>71 + 1 + 5 = \boxed{77} \Rightarrow \boxed{D}</math>

Revision as of 12:43, 3 September 2010

Problem 25

For every integer $n\ge2$, let $\text{pow}(n)$ be the largest power of the largest prime that divides $n$. For example $\text{pow}(144)=\text{pow}(2^4\cdot3^2)=3^2$. What is the largest integer $m$ such that $2010^m$ divides

$\prod_{n=2}^{5300}\text{pow}(n)$?


$\textbf{(A)}\ 74 \qquad \textbf{(B)}\ 75 \qquad \textbf{(C)}\ 76 \qquad \textbf{(D)}\ 77 \qquad \textbf{(E)}\ 78$


Solution

Because 67 is the largest prime factor of 2010, it means that in the prime factorization of $\prod_{n=2}^{5300}\text{pow}(n)$, there'll be $p_1 ^{e_1} \cdot p_2 ^{e_2} \cdot .... 67^x ...$ where $x$ is the desired value we are looking for. Thus, to find this answer, we need to look for the number of times 67 would be incorporated into the giant product. Any number of the form $x \cdot 67$ would fit this form. However, this number tops at $71 = x$ because 71 is a higher prime than 67. $67^2$ itself must be counted twice because it's counted twice as a squared number. Any non-prime number that's less than 79 (and greater than 71) can be counted, and this totals 5. Thus, $71 + 1 + 5 = \boxed{77} \Rightarrow \boxed{D}$

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2010_AMC_12B_Problems/Problem_25&oldid=35732"