Let n be a non-zero real number (not necessarily positive). Find the minimum value of
i = 1 ∏ 8 ( n 2 i + 1 ) + i = 1 ∏ 8 ( n 2 i 1 + 1 ) .
According to my thoughts, you need 3 things for solving math problems:
Knowledge
Imagination
Solve this problem to figure that one out.
Hint: The third word starts with T and ends with S . It may depend on each person whether this hint has actually helped or not.
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.
Nice observation.
You can approach this with AM-GM directly:
i = 1 ∏ 8 ( n 2 i + 1 ) + i = 1 ∏ 8 ( n 2 i 1 + 1 ) ≥ 2 i = 1 ∏ 8 ( n 2 i + 1 ) ( n 2 i 1 + 1 ) ≥ 2 i = 1 ∏ 8 4 = 5 1 2 .
Log in to reply
Could you please tell me how you simplified the geometric mean to get 512?
Log in to reply
Notice how sir Lin did not write an equality sign; the simplification of the geometric mean simply goes as follows: i = 1 ∏ 8 ( n 2 i + 1 ) ( n 2 i 1 + 1 ) = i = 1 ∏ 8 ( n 2 i n 2 i + n 2 i + n 2 i 1 + 1 ) = i = 1 ∏ 8 ( 2 + n 2 i + n 2 i 1 ) I think we must simply assume that this will have its minimum when n = 1 , resulting in Lin's expression after the geometric mean. Maybe multiplying n 2 i + n 2 i 1 with n 2 i shows the minimum value, as n 2 i is always positive, to occur at said n = 1 . Q.E.D? :P
Out of curiosity, what does the word have to do with problem?
Log in to reply
It should have taken a really long time to expand the 8 polynomials' product. Hahaha
How did you get 512?
The word could be "twos" as well. Setting n 2 i + 1 = 2 works as well.
Where does the 512 come from, and how is that the gm if there is no n root?
The claim that there are 206 terms in the expression next to that claim is not correct. There are 2 5 1 0 + 1 = 2 5 6 terms in both of the expressions where the claim is made.
This problem can quite easily be solved by simply assuming that the two products have their minimum when n is set to 0. Proving this would be more difficult, in which case AM-GM really shows to be impeccable in being both productive and analytically correct, unlike guessing the right answer.
small typing error .it is 256 in place of 206 .well solved.
Problem Loading...
Note Loading...
Set Loading...
ฺBy noticing: ( n 2 + 1 ) ( n 4 + 1 ) = n 6 + n 4 + n 2 + 1
( n 2 + 1 ) ( n 4 + 1 ) ( n 8 + 1 ) = n 1 4 + n 1 2 + n 1 0 + n 8 + n 6 + n 4 + n 2 + 1
And so, in a similar manner,
∏ i = 1 8 ( n 2 i + 1 ) = n 5 1 0 + n 5 0 8 + n 5 0 6 + . . . + 1 (206 Terms)
And in a similar manner,
∏ i = 1 8 ( n 2 i 1 + 1 ) = n 5 1 0 1 + n 5 0 8 1 + . . . + 1 (206 Terms)
By the A.M.-G.M. Inequality
∏ i = 1 8 ( n 2 i + 1 ) + ∏ i = 1 8 ( n 2 i 1 + 1 ) ≥ 5 1 2 ⋅ 1
∏ i = 1 8 ( n 2 i + 1 ) + ∏ i = 1 8 ( n 2 i 1 + 1 ) ≥ 5 1 2
Note that we can use the A.M.- G.M. Inequality because all members used in the Inequality are positive because n = 0 and n 2 i ≥ 0 when i is a positive integer.
And, the word is TOUGHNESS!