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

In how many ways can $12$ balls be distributed between two friends such that one gets $8$ balls and the other gets $4$ balls?

If ${}^{10}P_r = 604800$ and ${}^{10}C_r = 120$,then $r =$

From all the English alphabets,five letters are chosen and are arranged in alphabetical order. The total number of ways,in which the middle letter is $M$,is:

In how many ways can $10$ balls be divided between two boys,such that one receives $2$ balls and the other receives $8$ balls?

The number of ways in which $35$ apples can be distributed among $3$ boys so that each can have any number of apples,is

Difficult
View Solution

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