If $a_n = \sum_{r=0}^n \frac{1}{{}^n C_r}$,then $\sum_{r=0}^n \frac{r}{{}^n C_r} = $

  • A
    $(n-1) a_n$
  • B
    $n \cdot a_n$
  • C
    $\frac{n}{2} \cdot a_n$
  • D
    $a_{n+1}$

Explore More

Similar Questions

All the letters of the word $TABLE$ are permuted and the strings of letters (may or may not have meaning) thus formed are arranged in dictionary order. Then the rank of the word $TABLE$ counted from the rank of the word $BLATE$ is

The number of triplets $(x, y, z)$,where $x, y, z$ are distinct non-negative integers satisfying $x+y+z=15$,is

Match the items of List-$I$ to the items of List-$II$:
List-$I$ List-$II$
$(A)$ The number of ways of not selecting $(n-r)$ things from $n$ different things $(I)$ $1+n+{ }^n C_2+\ldots+{ }^n C_r$
$(B)$ $(n-r+1) \cdot{ }^n C_{r-1}$ $(II)$ $(r+1) \cdot{ }^n C_{r+1}$
$(C)$ The number of ways of selecting at least $(n-r)$ things from $n$ different things $(III)$ $r\left({ }^n C_r\right)$
$(D)$ $(n-r)\left({ }^{n-1} C_{r-1}+{ }^{n-1} C_r\right)$ $(IV)$ $2^n-1-n-{ }^n C_2-\ldots-{ }^n C_r$
$(V)$ ${ }^n C_{n-r}$

The correct match is:

The number of $5$ digit telephone numbers having at least one of their digits repeated is

Difficult
View Solution

Let $S = \{0, 1, 2, 3, \ldots, 100\}$. The number of ways of selecting $x, y \in S$ such that $x \neq y$ and $x + y = 100$ 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