For positive integer , let denote the minimum value of the sum
where are positive real numbers whose sum is . If there exist a unique positive integer for which is also an integer, then find .
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.
Let a k = ( 2 k − 1 ) tan α k . Then k = 1 ∑ n ( 2 k − 1 ) tan α k = 1 7 , k = 1 ∑ n ( 2 k − 1 ) sec α k = S n . So , k = 1 ∑ n ( 2 k − 1 ) sec 2 α k d α k = 0 . For S n to be minimum, k = 1 ∑ n sec α k tan α k d α k = 0 . Applying LaGrange's method of undetermined multipliers, we get k = 1 ∑ n sec α k ( sec α k + λ tan α k ) d α k ≡ 0 , where λ is an unknown constant to be determined. From this we get λ = − sin α k for all k , that is, sin α k = constant ⟹ α k = α = constant. Hence k = 1 ∑ n ( 2 k − 1 ) tan α = 1 7 ⟹ tan α = n 2 1 7 ⟹ S n = n 2 sec α = n 4 + 2 8 9 . Since S n has to be an integer, n 4 + 2 8 9 must be a perfect square. Let n 4 + 2 8 9 = a 2 . Then ( n 2 + a ) ( n 2 − a ) = 1 7 × 1 7 . Since 1 7 is prime , n 2 − a = 1 , n 2 + a = 2 8 9 ⟹ n 2 = 1 4 4 ⟹ n = 1 2 ⟹ 2 n = 6 .