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

Find the number of ways of selecting $9$ balls from $6$ red balls,$5$ white balls,and $5$ blue balls if each selection consists of $3$ balls of each colour.

In a shop,there are $5$ types of ice-creams available. $A$ child buys $6$ ice-creams.
$Statement-1$: The number of different ways the child can buy the $6$ ice-creams is $^{10}C_5$.
$Statement-2$: The number of different ways the child can buy the $6$ ice-creams is equal to the number of different ways of arranging $6$ $A$'s and $4$ $B$'s in a row.

There are two urns. Urn $A$ contains $3$ distinct red balls,and Urn $B$ contains $9$ blue balls. If two balls are selected at random from each urn and swapped,in how many ways can this operation be performed?

Difficult
View Solution

The number of ways in which $21$ identical apples can be distributed among three children such that each child gets at least $2$ apples,is

$A$ bag contains $5$ red marbles,$4$ black marbles,and $3$ white marbles. The number of ways in which $4$ marbles can be drawn so that at most $2$ of them are red 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