Non-negative real numbers a , b , c , and d are such that a + b + c + d = 1 0 0 . Find the maximum value of the sum below.
3 b + 7 a + 3 c + 7 b + 3 d + 7 c + 3 a + 7 d
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.
These inequalities are giving us an upper bound. You haven't shown that the bound can be achieved.
Three of the bounds offered as solutions are clearly too low, as demonstrated by a=b=c=d=25. But even if I let a,c-> 0 and b = 50-a, d=50-c, I get nowhere near this number. I find it harder to get higher than ~3.85187.
Generally speaking, it seems that we'd want most of the weight on two non-consecutive terms. Other options are giving lower sums (work not shown.)
how did you get that idea of choosing (x-1)^2(x-7)^2/(x^2+7). you want something like 1/(b+7)<= some quadratic function of squareroot(b). this is adhoc. only thing i can see is that you wanted to get rid of squareroot(a) thing.
Problem Loading...
Note Loading...
Set Loading...
By using Hölder's inequality:
S = ⎝ ⎛ c y c ∑ 3 b + 7 6 a ⋅ 6 a ⎠ ⎞ 3 ≤ c y c ∑ ( 6 a ) 3 ⋅ c y c ∑ ( 6 a ) 3 ⋅ c y c ∑ ( 3 b + 7 1 ) 3 = ⎝ ⎛ c y c ∑ a ⎠ ⎞ 2 ∑ b + 7 1 .
Notice that :
x 2 + 7 ( x − 1 ) 2 ( x − 7 ) 2 ≥ 0 ⟺ x 2 − 1 6 x + 7 1 ≥ x 2 + 7 4 4 8
yields
∑ b + 7 1 ≤ 4 4 8 1 ∑ ( b − 1 6 b + 7 1 ) = 4 4 8 1 ( 3 8 4 − 1 6 ∑ b ) = 5 6 4 8 − 2 ∑ b .
Finally,
S 3 ≤ 5 6 1 ( ∑ a ) 2 ( 4 8 − ∑ 2 a ) ≤ 5 6 1 ⎝ ⎜ ⎛ 3 ∑ a + ∑ a + ( 4 8 − ∑ 2 a ) ⎠ ⎟ ⎞ 3 = 7 5 1 2
by the AM-GM inequality.
This bound is achieved when ( a , b , c , d ) is a cyclic permutation of ( 1 , 4 9 , 1 , 4 9 . )