Question
Question: find the number of ways in which 18 identical balls can be used in 15 different cricket matches.... ...
find the number of ways in which 18 identical balls can be used in 15 different cricket matches.... find the number of ways in which 18 identical balls can be used in 15 different cricket matches such that at least one ball is used in one match.
680
Solution
The problem asks us to find the number of ways to distribute 18 identical balls into 15 different cricket matches such that at least one ball is used in one match.
Let xi be the number of balls used in the i-th cricket match, where i ranges from 1 to 15. Since the balls are identical and the matches are different, we are looking for the number of integer solutions to the equation: x1+x2+⋯+x15=18
The phrase "at least one ball is used in one match" is crucial. This phrase can be interpreted in two ways:
- Interpretation 1 (Common in combinatorics): At least one ball is used in each match. This means xi≥1 for all i=1,2,…,15.
- Interpretation 2 (Literal but often trivial): At least one ball is used in at least one match. This means that not all xi are zero. Since the total number of balls is 18, it is impossible for all xi to be zero (as their sum must be 18). Therefore, if this interpretation is taken, the condition is automatically satisfied, and the problem reduces to finding the number of non-negative integer solutions to the equation without any further restrictions, which would be (15−118+15−1)=(1432).
Given that a specific condition is added to the problem statement, it is highly probable that it is intended to impose a non-trivial restriction. In combinatorial problems involving distribution, "at least one" usually implies "at least one in each category". Thus, we proceed with Interpretation 1.
Interpretation 1: At least one ball is used in each match (i.e., xi≥1 for all i).
To solve this, we can use the stars and bars method. Since each of the 15 matches must receive at least one ball, we first place one ball in each of the 15 matches. Number of balls used = 1×15=15. Number of balls remaining = 18−15=3.
Now, we need to distribute these 3 remaining identical balls among the 15 different matches. There are no further restrictions on these remaining balls (a match can receive zero or more of these additional balls). Let yi be the number of additional balls given to match i. Then, we need to find the number of non-negative integer solutions to the equation: y1+y2+⋯+y15=3
Here, n=3 (the number of remaining identical items, i.e., stars) and k=15 (the number of distinct bins, i.e., bars needed is k−1). The number of non-negative integer solutions is given by the stars and bars formula: (k−1n+k−1) or (nn+k−1).
Substituting n=3 and k=15: Number of ways = (15−13+15−1) Number of ways = (1417)
Alternatively, using the other form: Number of ways = (33+15−1) Number of ways = (317)
Both expressions are equivalent, as (RN)=(N−RN). Let's calculate the value of (317): (317)=3!(17−3)!17!=3!14!17!=3×2×117×16×15 (317)=17×216×315 (317)=17×8×5 (317)=17×40 (317)=680
The number of ways is 680.
The final answer is 680.
Explanation of the solution:
The problem requires distributing 18 identical balls into 15 different matches such that each match receives at least one ball.
- Assign one ball to each of the 15 matches. This uses 15 balls.
- Remaining balls: 18−15=3.
- Distribute these 3 remaining identical balls among the 15 different matches (any match can receive 0 or more).
- This is a stars and bars problem with n=3 (stars) and k=15 (bins).
- The number of ways is (k−1n+k−1)=(15−13+15−1)=(1417).
- (1417)=(317)=3×2×117×16×15=17×8×5=680.