Difference between revisions of "2010 AMC 12B Problems/Problem 25"
m (→See Also)
|Line 25:||Line 25:|
Latest revision as of 21:26, 16 February 2021
For every integer , let be the largest power of the largest prime that divides . For example . What is the largest integer such that divides
Because 67 is the largest prime factor of 2010, it means that in the prime factorization of , there'll be where is the desired value we are looking for. Thus, to find this answer, we need to look for the number of times is incorporated into the giant product.
All numbers , given such that for any integer between and , prime must be less than , contributes a 67 to the product. Considering , the possible values of x are , since are primes that are greater than 67. However, contributes two s to the product, so we must count it twice. Therefore, the answer is .
After finding the prime factorization of , divide by and add divided by in order to find the total number of multiples of between and . Since ,, and are prime numbers greater than and less than or equal to , subtract from to get the answer .
Need Discussion + Clarification?
How do we know that we only have to check 67? There is no solid relationship between 67 being the largest prime factor in 2010 and 67 giving the smallest result of 77. Ok, 67 is waaaay larger than any of the other prime factors of 2010. 2001's prime factors are close so there might be some ambiguity but if you can't see why given intervals of 67, 2s 3s and 5s don't need to be accounted for, you probably can't solve this problem .-.. Details in the Discussions page of this Article: http://artofproblemsolving.com/wiki/index.php?title=Talk:2010_AMC_12B_Problems/Problem_25
Response to concern: When I solved it, I actually ended up trying 2, 3, and 5 just to be safe. It actually ends up not being that bad (since for each one, we only need to consider numbers that only have that prime and lower primes in its prime factorization, so you can just divide 5300 by your prime, find how many numbers less than that new number are only divisible by lower primes, divide by your prime again, and repeat). All said and done, it only ended up taking about 7-8 minutes of mental math (ran out of paper oops), and I think that reasonably speaking, many who are good enough to have a decent chance of solving this 25 can check 2, 3, and 5 on paper in 5 minutes.
|2010 AMC 12B (Problems • Answer Key • Resources)|
|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|