JEE PYQ

[JEE Advanced 1996] for n k k 1 2 the number of integer solutions x 1 x

VAVidaara Admin Asked 2d ago 0 views 1 answer

For $n\ge\frac{k(k+1)}2$, the number of integer solutions $(x_1,\dots,x_k)$ with $x_i\ge i$ and $x_1+\cdots+x_k=n$ is ____

1 Answer

VAVidaara Admin ✓ Vidaara Team ✓ Accepted · 2d ago ▲ 0

Answer: $\dbinom{\,n-\frac{k(k+1)}2+k-1\,}{\,k-1\,}$.

Put $y_i=x_i-i\ge0$; then $\sum y_i=n-\frac{k(k+1)}2$, and the number of non-negative solutions is $\binom{n-\frac{k(k+1)}2+k-1}{k-1}$.

JEE Advanced 1996 · Quadratic Equations and Inequations — verified solution by the Vidaara Team.

Log in to post your own answer or join the discussion.

Discussion (0)

No comments yet — start the discussion.

← Back to all questions