Let $n \geq 3$ be an integer. For a permutation $\sigma = (a_1, a_2, \ldots, a_n)$ of $(1, 2, \ldots, n)$,we define $f_\sigma(x) = a_n x^{n-1} + a_{n-1} x^{n-2} + \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 permutations $\sigma$ of $(1, 2, \ldots, n)$ of the values $S_\sigma$. Then,

  • A
    $S < -n!$
  • B
    $-n! < S < 0$
  • C
    $0 < S < n!$
  • D
    $n! < S$

Explore More

Similar Questions

For a natural number $n$,the inequality $2^n(n - 1)! < n^n$ holds true if:

The total number of $7$-digit numbers that can be formed using only the digits $1, 2,$ and $3$ such that the sum of the digits is $10$ is:

Difficult
View Solution

Out of $8$ students in a classroom,$4$ of them are chosen and they are arranged around a table. If the remaining $4$ are arranged in a row,then the total number of arrangements that can be made with those $8$ students is

$A$ man $P$ has $7$ friends,$4$ of them are ladies and $3$ are men. His wife $Q$ also has $7$ friends,$3$ of them are ladies and $4$ are men. Assume $P$ and $Q$ have no common friends. Then the total number of ways in which $P$ and $Q$ together can throw a party inviting $3$ ladies and $3$ men,so that $3$ friends of each of $P$ and $Q$ are in this party,is . . . . . . .

There are three sections in a question paper,each section containing $4$ questions. If a candidate has to answer exactly $5$ questions from this paper such that at least one question is answered from each section,then the number of ways in which a candidate can make the choice of questions is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo