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

$A$ group consists of $8$ boys and $5$ girls. The number of committees of $5$ persons that can be formed,if the committee consists of at least $2$ girls and at most $2$ boys,is:

There are ten boys $B_{1}, B_{2}, \ldots, B_{10}$ and five girls $G_{1}, G_{2}, \ldots, G_{5}$ in a class. The number of ways of forming a group consisting of three boys and three girls,such that $B_{1}$ and $B_{2}$ are not both members of the same group,is

$A$ committee of $4$ members is to be formed from $4$ couples (husbands and wives). In how many ways can the committee be formed such that no couple is included in the committee?

Difficult
View Solution

$A$ bag contains $5$ black and $6$ red balls. Determine the number of ways in which $2$ black and $3$ red balls can be selected.

What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these do the four cards belong to four different suits?

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