Difference between revisions of "2016 AMC 8 Problems/Problem 15"
Themathgood (talk | contribs) (Added another solution.) |
|||
Line 31: | Line 31: | ||
-Benedict T (countmath1) | -Benedict T (countmath1) | ||
+ | == Solution 4 (NOT RECOMMENDED) == | ||
+ | WE can simply take 13 to the fourth, which is 28561. We subtract that by 11 to the fourth, which is 14641 (You can use Pascal's Triangle to find this). Finally, subtract the numbers to get 13920. | ||
+ | |||
+ | To test the options, since we need the largest one, we can go from top down. Testing, we see that both D and E are decimals, | ||
+ | and 32 works. So, our answer is <math>2\cdot16=\boxed{\textbf{(C)}~32}.</math> | ||
+ | |||
+ | Note: This is not the fastest way. | ||
== Video Solution by OmegaLearn== | == Video Solution by OmegaLearn== | ||
https://youtu.be/HISL2-N5NVg?t=3705 | https://youtu.be/HISL2-N5NVg?t=3705 |
Revision as of 21:12, 25 December 2023
Contents
Problem
What is the largest power of that is a divisor of ?
Solution 1
First, we use difference of squares on to get . Using difference of squares again and simplifying, we get . Realizing that we don't need the right-hand side because it doesn't contain any factor of 2, we see that the greatest power of that is a divisor is .
Solution 2 (a variant of Solution 1)
Just like in the above solution, we use the difference-of-squares factorization, but only once to get We can then compute that this is equal to Note that (we don't need to factorize any further as is already odd) thus the largest power of that divides is only while so the largest power of that divides is Hence, the largest power of that is a divisor of is
Solution 3 (Lifting the exponent)
Let We wish to find the largest power of that divides .
Denote as the largest exponent of in the prime factorization of . In this problem, we have .
By the Lifting the Exponent Lemma on ,
Therefore, exponent of the largest power of that divids is so the largest power of that divides this number is .
-Benedict T (countmath1)
Solution 4 (NOT RECOMMENDED)
WE can simply take 13 to the fourth, which is 28561. We subtract that by 11 to the fourth, which is 14641 (You can use Pascal's Triangle to find this). Finally, subtract the numbers to get 13920.
To test the options, since we need the largest one, we can go from top down. Testing, we see that both D and E are decimals, and 32 works. So, our answer is
Note: This is not the fastest way.
Video Solution by OmegaLearn
https://youtu.be/HISL2-N5NVg?t=3705
~ pi_is_3.14
Video Solution
~savannahsolver
Video Solution (CREATIVE THINKING!!!)
~Education, the Study of Everything
See Also
2016 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Problem 16 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.