a 2 0 0 ⋅ b 5 0 0 ⋅ c 1 6 ⋅ d 6 0 0 ⋅ e 7 0 0
Let a , b , c , d and e be positive reals whose sum is 2016, and M the maximum value of the expression above. Then what is the highest power of 3 that divides M ?
Tip : Wait for the hardest version .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I purposely gave the exponents whose sum is 2016
Absolutely correct approach .(+1)
@Aareyan Manzoor , where should we discuss about the wiki then ? Lets do it on my messageboard is it okay ?
Log in to reply
Yeah I am too surprised it crossed 300 !!?? @Dev Sharma
Did the same.
I took the same approach with using weighted the AM/GM inequality as Aareyan except I weighted it over 50, 125, 4, 150, 175 terms for a, b, c, d, e respectively. This works because 4 is the gcd of all of the exponents in the expression of interest.
I still raised to the equation to the 2016th power but this end result is slightly easier numbers to work with because I had an additional 4 2 0 1 6 factored out (ie M = 4 2 0 1 6 5 0 2 0 0 1 2 5 5 0 0 4 1 6 1 5 0 6 0 0 1 7 5 7 0 0 ).
Equality holds when 5 0 a = 1 2 5 b = 4 c = 1 5 0 d = 1 7 5 e = 5 0 4 2 0 1 6 = 4
Problem Loading...
Note Loading...
Set Loading...
use weighted am-gm: 2 0 0 + 5 0 0 + 1 6 + 6 0 0 + 7 0 0 2 0 0 2 0 0 a + 5 0 0 5 0 0 b + 1 6 1 6 c + 6 0 0 6 0 0 d + 7 0 0 7 0 0 e ≥ 2 0 0 + 5 0 0 + 1 6 + 6 0 0 + 7 0 0 ( 2 0 0 a ) 2 0 0 ( 5 0 0 b ) 5 0 0 ( 1 6 c ) 1 6 ( 6 0 0 d ) 6 0 0 ( 7 0 0 e ) 7 0 0 the LHS is 1.raise 2016 to both sides. multiply both sides with the huge numbers. we have S ≤ 2 0 0 2 0 0 × 5 0 0 5 0 0 × 1 6 1 6 × 6 0 0 6 0 0 × 7 0 0 7 0 0
Only one of these numbers is divisible by 3, that is 6 0 0 6 0 0 = 3 6 0 0 × 2 0 0 2 0 0 . The highest power of 3 that divides M is 6 0 0 .