Let n ≥ 3 be an integer. For an ordered n-tuple of permutation σ of ( 1 , 2 , ⋯ , n ) , where σ = ( a 1 , a 2 , ⋯ , a n ) let a function be defined as under
f σ ( x ) = a n x n − 1 + a n − 1 x n − 2 + ⋯ + a 2 x + a 1
Let S σ denote the sum of solutions to f σ ( x ) = 0 and further denote another sum S as
S = over all permutations of σ ∑ S σ .
Choose the most appropriate alternative.
Original problem: KVPY 2014 SB/SX
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 wasn't able to solve the problem myself so I published the problem hoping I get a solution. Thanks for uploading the solution.
However, I was left behind at this part
u , v = 1 ∑ n v u = 2 1 n ( n + 1 ) H n
Can you please explain it to me? I know the definition of harmonic number but couldn't connect the dots here.
Log in to reply
The LHS simply factorises as ( u ∑ u ) ( v ∑ v − 1 )
Problem Loading...
Note Loading...
Set Loading...
Since f σ = − a n a n − 1 , we see that S = − σ ∑ a n a n − 1 = − u = v ∑ v u ( n − 2 ) ! = − ( n − 2 ) ! ( u , v = 1 ∑ n v u − n ) = − ( n − 2 ) ! [ 2 1 n ( n + 1 ) H n − n ] = − n × ( n − 2 ) ! [ 2 1 ( n + 1 ) H n − 1 ] Note that 2 H 3 − 1 = 3 8 > 2 . Moreover, since H 4 = 1 2 2 5 we see that 2 1 ( n + 1 ) H n − 1 ≥ 2 4 2 5 ( n + 1 ) − 1 > n − 1 for all n ≥ 4 , and so we see that S < − n ! for n ≥ 3 .