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

There are $4$ men and $5$ women in Group $A$,and $5$ men and $4$ women in Group $B$. If $4$ persons are selected from each group,then the number of ways of selecting $4$ men and $4$ women is:

$A$ test containing $3$ objective-type questions is conducted in a class. Each question has $4$ options and only one option is the correct answer. No two students of the class have answered identically,and no student has written all correct answers. If every student has attempted all the questions,then the maximum possible number of students who have written the test is:

The number of distinct primes dividing $12! + 13! + 14!$ is

Let $n = 1! + 4! + 7! + \ldots + 400!$. Then the ten's digit of $n$ is

The number of $4$-letter permutations formed using the English alphabet such that the number of distinct vowels is equal to the number of distinct consonants,when repetition is allowed,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