if i = 1 ∑ 9 cos ( x i ) = 0 for real numbers x 1 , x 2 , . . . , x 9 , find the maximum possible value of i = 1 ∑ 9 cos ( 3 x i )
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.
Here are 9 terms. Question - what is the answer for 10 terms? I suppose 480/49.
Log in to reply
Yes. I think recently I have seen a problem posted about the original problem, but I can't find it anymore, maybe it has been deleted. Anyway, it's quite interesting that when the number of terms isn't a multiple of 3 the problem becomes much harder. A solution to the original problem can be found here , but I found it a little hard to follow.
My solution envolved:
Now you only need to prove a couple of things:
This proves there can only be two values in the sequence: 1 , repeated a times, and − v , repeated 1 0 − a times. Now you can just test what is the maximum sum by checking all the values of a from 1 to 1 0 .
It turns out a = 3 , so the first sum is 3 − 7 v = 0 and v = 7 3 , so the second sum is 4 ( 3 − 7 ( 7 3 ) 3 ) = 4 9 4 8 0
Log in to reply
Fine. Solution by Lagrange method from Mark Hennings was here - but it is delete.
We want cos ( 3 θ ) = 1 that's true if θ = 3 2 π and recall that cos ( θ ) = − cos ( π − θ ) and so cos ( 3 2 π ) = − cos ( 3 π ) And cos ( 3 π ) is precisely half the base of an equilateral triangle, so cos ( 3 π ) = 2 1 thus we have cos ( 3 2 π ) = − 2 1 ⇔ 2 ⋅ cos ( 3 2 π ) = − 1 We note that cos ( 0 ) = 1 and so then cos ( 3 2 π ) + cos ( 3 2 π ) + cos ( 0 ) = 0 ⇔ 3 ⋅ ( cos ( 3 2 π ) + cos ( 3 2 π ) + cos ( 0 ) ) = 0 Now when we triple each angle, every cosine becomes one and we get 3 ( cos ( 2 π ) + cos ( 2 π ) + cos ( 0 ) ) = 9
1.Use the formula of cos(3x)
∑ i = 1 9 c o s ( 3 x i ) = ∑ i = 1 9 ( 4 c o s 3 x i − 3 c o s ( x i ) ) = ∑ i = 1 9 4 c o s 3 x i
2.Considering there're 9 x i , to find the maximum, must in the following circumstance.
x i =1, 1, 1, 1, 9 − k − k , ..... 9 − k − k
k is the number of 1
so ∑ i = 1 9 4 c o s 3 x i = k + ( 9 − k ) 2 ( − k ) 3
obviously, choose k=3, the sum is 9
Problem Loading...
Note Loading...
Set Loading...
The maximum possible value for a sum like i = 1 ∑ 9 cos ( y i ) for a sequence y 1 , y 2 , . . . , y 9 is, of course, 9 as the maximum value of cos ( x ) is 1 at x ≡ 0 .
Now, note that cos ( 0 ) + cos ( 3 2 π ) + cos ( 3 4 π ) = 0 and 3 ⋅ 0 ≡ 3 ⋅ 3 2 π ≡ 3 ⋅ 3 4 π ≡ 0 , so, with the sequence ( 0 , 0 , 0 , 3 2 π , 3 2 π , 3 2 π , 3 4 π , 3 4 π , 3 4 π ) , we satisfy the first sum, and the second sum is 9