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

The tens digit of the sum $1! + 4! + 7! + 10! + 12! + 13! + 16! + 17!$ is divisible by which of the following?

Difficult
View Solution

Four notes of Rs. $100$ and one note each of Rs. $1$,Rs. $2$,Rs. $5$,Rs. $20$,and Rs. $50$ are to be distributed among $3$ children such that each child receives at least one note of Rs. $100$. In how many ways can this distribution be done?

Difficult
View Solution

The number of positive integral solutions of the equation $xyz = 90$ is equal to :-

$A$ building has a ground floor and $10$ more floors. Nine persons enter a lift at the ground floor. The lift goes up to the $10$th floor. The number of ways in which any $4$ persons exit at a floor and the remaining $5$ persons exit at a different floor, if the lift does not stop at the first and the second floors, is equal to:

The number of seven-digit numbers that can be formed by using the digits $1, 2, 3, 5,$ and $7$ such that each digit is used at least once 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