Let $n$ and $k$ be positive integers such that $n \ge \frac{k(k + 1)}{2}$. The number of solutions $(x_1, x_2, ..., x_k)$ where $x_1 \ge 1, x_2 \ge 2, ..., x_k \ge k$ are all integers,satisfying $x_1 + x_2 + ... + x_k = n$,is

  • A
    $^mC_{k-1}$
  • B
    $^mC_{k+1}$
  • C
    $^mC_k$
  • D
    None of these (where $m = \frac{1}{2}(2n - k^2 + k - 2)$)

Explore More

Similar Questions

If $^{2n}C_3 : ^nC_2 = 44:3$,then for which of the following values of $r$,the value of $^nC_r$ will be $15$?

$A$ committee of $3$ persons is to be constituted from a group of $2$ men and $3$ women. In how many ways can this be done? How many of these committees would consist of $1$ man and $2$ women?

$A$ student is allowed to choose at most $n$ books from a collection of $2n+1$ books. If the total number of ways in which he can select at least one book is $255$,then the value of $n$ is:

If $^nC_r = 84$,$^nC_{r-1} = 36$,and $^nC_{r+1} = 126$,then $n$ equals

From $5$ consonants and $5$ vowels,how many words can be formed using $3$ consonants and $2$ vowels?

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