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

The value of $r$ for which $^{20}C_r ^{20}C_0 + ^{20}C_{r-1} ^{20}C_1 + ^{20}C_{r-2} ^{20}C_2 + ... + ^{20}C_0 ^{20}C_r$ is maximum is

$^{14}C_4 + \sum_{j=1}^{4} {^{18-j}C_3}$ is equal to

In how many ways can $6$ '$+$' signs and $4$ '$*$' signs be arranged in a row such that no two '$*$' signs occur together?

$A$ student has to answer a multiple-choice question having $5$ alternatives in which two or more than two alternatives are correct. Then the number of ways in which the student can answer that question is

The number of integral solutions to the equation $x+y+z=21$,where $x \geq 1, y \geq 3, z \geq 4$,is equal to $..........$.

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