Let n and k be positive integers such that n ≥ ^k+1C2. The number of solutions (x1, x2,....xk); x1 ≥ 1 ≥ x2 ≥ 2,.....

Let n and k be positive integers such that n ≥ ^k+1C₂. The number of solutions (x₁, x₂,....x_k); x₁ ≥ 1 ≥ x₂ ≥ 2,.......x_k ≥ k all integers satisfying x₁ + x₂ +...+ x_k = n is

a. \(^{n-\frac k2}C_k\)

b. \(^{n-1-\frac k2}C_k\)

c. \(^{n-1-\frac k2}C_{k-1}\)

d. \(^{n+1-\frac k2}C_{k-1}\)

Let n and k be positive integers such that n ≥ ^k+1C2. The number of solutions (x1, x2,....xk); x1 ≥ 1 ≥ x2 ≥ 2,.......xk ≥ k

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Find MCQs & Mock Test

Related questions

Categories