Join the Most Relevant JEE Main 2025 Test Series & get 99+ percentile! Join Now
Search any question & find its solution
Question: Answered & Verified by Expert
Let $n \geq 3$ be an integer. For a permutation $\sigma=\left(a_{1}, a_{2}, \ldots a_{n}\right)$ of $(1,2, \ldots, n)$ we let $f \sigma(x)=a_{n} x^{n-1}+a^{n-1}+\ldots+a_{2} x+a_{1} .$ Let $S \sigma$ be the sum of the roots of $f \sigma(x)=0$ and let $S$ denote the sum over all permutation $\sigma$ of $(1,2, \ldots, n)$ of the number $S_{\sigma}$. Then
MathematicsSequences and SeriesKVPYKVPY 2014 (SB/SX)
Options:
  • A $S < -n !$
  • B $-n ! < S < 0$
  • C $0 < S < n !$
  • D $n ! < S$
Solution:
1065 Upvotes Verified Answer
The correct answer is: $S < -n !$
No Solution

Looking for more such questions to practice?

Download the MARKS App - The ultimate prep app for IIT JEE & NEET with chapter-wise PYQs, revision notes, formula sheets, custom tests & much more.