In how many different ways can three persons | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let $x_1, x_2, x_3$ be the number of coins donated by $A, B, C$ respectively. We need to find the number of non-negative integer solutions to $x_1

Vedclass · Accepted Answer

$47$

Vedclass · Answer

(A) Let $x_1, x_2, x_3$ be the number of coins donated by $A, B, C$ respectively. We need to find the number of non-negative integer solutions to $x_1 + x_2 + x_3 = 10$ subject to $0 \le x_1 \le 6, 0 \le x_2 \le 7, 0 \le x_3 \le 8$.Total solutions without constraints using stars and bars formula ${ }^{(n+r-1)} C_{r-1}$ is ${ }^{(10+3-1)} C_{3-1} = { }^{12} C_2 = 66$.Using the Principle of Inclusion-Exclusion:Let $S$ be the set of all non-negative solutions $(|S| = 66)$.Let $P_1$ be the condition $x_1 \ge 7$,$P_2$ be $x_2 \ge 8$,$P_3$ be $x_3 \ge 9$.Number of solutions satisfying $P_1$: $x_1' + x_2 + x_3 = 10 - 7 = 3 \implies { }^{(3+3-1)} C_2 = { }^5 C_2 = 10$.Number of solutions satisfying $P_2$: $x_1 + x_2' + x_3 = 10 - 8 = 2 \implies { }^{(2+3-1)} C_2 = { }^4 C_2 = 6$.Number of solutions satisfying $P_3$: $x_1 + x_2 + x_3' = 10 - 9 = 1 \implies { }^{(1+3-1)} C_2 = { }^3 C_2 = 3$.Intersections like $P_1 \cap P_2$: $x_1 + x_2 + x_3 = 10 - 7 - 8 = -5$ (Impossible,$0$ ways).Total valid ways $= 66 - (10 + 6 + 3) + 0 = 47$.

In how many different ways can three persons $A, B, C$ having $6, 7$ and $8$ one-rupee coins respectively,donate $₹ 10$ collectively?

Similar Questions

Let $x, y, z$ be three non-negative integers such that $x+y+z=10$. The maximum possible value of $xyz+xy+yz+zx$ is

The number of $6$-letter words,with or without meaning,that can be formed using the letters of the word $\text{MATHS}$ such that any letter that appears in the word must appear at least twice,is $...$

The value of $\sum\limits_{r = 0}^{15} {\left( {{}^{15}{C_r} \cdot {}^{40}{C_{15}} \cdot {}^{20}{C_r} - {}^{35}{C_{15}} \cdot {}^{15}{C_r} \cdot {}^{25}{C_r}} \right)}$ is:

The minimum value of $f(x) = |x - 1| + |2x - 1| + |3x - 1| + \dots + |119x - 1|$ occurs at $x$. Then $x$ is equal to

The remainder obtained when $1! + 2! + 95!$ is divided by $15$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module