Question
Question: Find the number of ways in which five bowlers of different ages can choose to bowl one over each one...
Find the number of ways in which five bowlers of different ages can choose to bowl one over each one after the other, if the oldest brother should not bowl the first over.
A. 96
B. 84
C. 92
D. 98
Solution
Here we use the concept of combinations to find the number of ways for an over to be bowled by a bowler. Since we have to keep exception for the first over that cannot have the oldest bowler, we reduce one bowler from the total number of bowlers and then choose.
- Combination formula is given by nCr=(n−r)!r!n!, where n is total number of items w are choosing from and r is number of items we are selecting.
Complete step-by-step answer:
Let us assume the five bowlers as B1,B2,B3,B4,B5 where the bowler B5is the oldest.
Now we find a number of ways an over can be bowled separately.
First over:
We have total number of bowlers as 5
But since first over cannot be bowled by the oldest bowler, so we have number of bowlers as 5−1=4
So, n=4
Now only one bowler can bowl at a time, so we take r=1.
Therefore, the number of ways one player can bowl first over is 4C1.
Solve the value of4C1 using the formula nCr=(n−r)!r!n!
⇒4C1=(4−1)!1!4!
⇒4C1=3!1!4!
We know factorial opens up as n!=n(n−1)!
⇒4C1=3!1!4×3!
Cancel the same terms from numerator and denominator and put 1!=1
⇒4C1=4
Second over:
Now we have a total number of bowlers as 4.
So, n=4
Now only one bowler can bowl at a time, so we take r=1.
Therefore, the number of ways one player can bowl second over is 4C1.
Solve the value of4C1 using the formula nCr=(n−r)!r!n!
⇒4C1=(4−1)!1!4!
⇒4C1=3!1!4!
We know factorial opens up as n!=n(n−1)!
⇒4C1=3!1!4×3!
Cancel the same terms from numerator and denominator and put 1!=1
⇒4C1=4
Third over:
Now we have a total number of bowlers as 3.
So, n=3
Now only one bowler can bowl at a time, so we take r=1.
Therefore, the number of ways one player can bowl third over is 3C1.
Solve the value of3C1 using the formula nCr=(n−r)!r!n!
⇒3C1=(3−1)!1!3!
⇒3C1=2!1!3!
We know factorial opens up as n!=n(n−1)!
⇒3C1=2!1!3×2!
Cancel the same terms from numerator and denominator and put 1!=1
⇒3C1=3
Fourth over:
Now we have a total number of bowlers as 2.
So, n=2
Now only one bowler can bowl at a time, so we take r=1.
Therefore, the number of ways one player can bowl fourth over is 2C1.
Solve the value of2C1 using the formula nCr=(n−r)!r!n!
⇒2C1=(2−1)!1!2!
⇒2C1=1!1!2!
We know factorial opens up as n!=n(n−1)!
⇒2C1=1!1!2×1!
Cancel the same terms from numerator and denominator and put 1!=1
⇒2C1=2
Fifth over:
Now we have a total number of bowlers as 1.
So, n=1
Now only one bowler can bowl at a time, so we take r=1.
Therefore, the number of ways one player can bowl fifth over is 1C1.
Solve the value of1C1 using the formula nCr=(n−r)!r!n!
⇒1C1=(1−1)!1!1!
⇒1C1=0!1!1!
Cancel the same terms from numerator and denominator and put 0!=1
⇒1C1=1
Therefore, the total number of ways in which 5 bowlers can bowl is given by multiplication of the number of ways each over can be bowled.
Number of ways to bowl =4×4×3×2×1
Number of ways to bowl =96
So, the correct option is A.
Note: Alternate method:
Students can solve the number of ways to bowl 5 overs without the use of combinations also.
Since there are 5 overs to bowl and 5 players
Choices of bowler for first over is 4 (because the oldest bowler is not included)
Choices of bowler for second over is 4 (because we have 4 bowlers left)
Choices of bowler for third over is 3 (because we have 3 bowlers left)
Choices of bowler for fourth over is 4 (because we have 2 bowlers left)
Choices of bowler for fifth over is 4 (because we have 1 bowlers left)
So, total number of ways to bowl =4×4×3×2×1
Number of ways to bowl =96