Solveeit Logo

Question

Question: Box 1 contains three cards bearing numbers 1, 2, 3; box 2 contains five cards bearing numbers 1, 2, ...

Box 1 contains three cards bearing numbers 1, 2, 3; box 2 contains five cards bearing numbers 1, 2, 3, 4, 5; and box 3 contains seven cards bearing numbers 1, 2, 3, 4, 5, 6, 7. A card is drawn from each of the boxes. Let xi{x_i} be the number on the card drawn from the ith{i^{th}} box, i=1,2,3.i = 1,2,3.
The probability that x1,x2,x3{x_1},{x_2},{x_3} are in an arithmetic progression is:
A) 9105\dfrac{9}{{105}}
B) 10105\dfrac{{10}}{{105}}
C) 11105\dfrac{{11}}{{105}}
D) 7105\dfrac{7}{{105}}

Explanation

Solution

Probability of an event A, is the ratio of the number of outcomes favorable to the event, to the total number of outcomes. Event is the occurrence/ experiment whose probability has to find.
P(A) = number of favorable outcomestotal number of outcomes\dfrac{{{\text{number of favorable outcomes}}}}{{{\text{total number of outcomes}}}}
First, you need to find the number of favorable outcomes of the given condition i.e. the three cards one from each box are in Arithmetic progression, by using combinations. Then find the total number of outcomes i.e. selecting three cards one from each box by using combinations.
An arithmetic progression (A.P.) is a sequence in which terms increase or decrease regularly by the same constant. The constant is called the common difference of A.P. This will help you to draw cases for the condition that the x1,x2,x3{x_1},{x_2},{x_3} are in an arithmetic progression.
‘AND’ operations are substituted with ×' \times ', implying both are likely to happen together.
‘OR’ operations are substituted with +' + ', implying either of the one possibility is likely to happen.
The number of combinations of nndifferent things taken rrat a time, denoted by C(n,r)C\left( {n,r} \right) , is given by
C(n,r)=n!r!(nr)!C\left( {n,r} \right) = \dfrac{{n!}}{{r!\left( {n - r} \right)!}}
For example: Find a number of ways in selecting two cards from box 3 of the given question which is even.
Even cards in box 3 = 2, 4, 6
Total numbers of even card in box 3, nn = 3
Number of cards selecting, rr= 2
Therefore, the number of ways or combination of selecting 2 cards which are even C(n,r)C\left( {n,r} \right) =C(3,2) = C\left( {3,2} \right)
=3!2!(32)!=3!2!(1)!=3×2!2!(1)=3= \dfrac{{3!}}{{2!\left( {3 - 2} \right)!}} = \dfrac{{3!}}{{2!\left( 1 \right)!}} = \dfrac{{3 \times 2!}}{{2!\left( 1 \right)}} = 3

Complete step-by-step answer:
Step 1: Find the condition for which x1,x2,x3{x_1},{x_2},{x_3} are in A.P.

Diagram: Pictorial representation of the question.
Given that x1{x_1} card is drawn from box 1.
x2{x_2} the card is drawn from box 1.
x3{x_3} the card is drawn from box 1.
For x1,x2,x3{x_1},{x_2},{x_3} to be in Arithmetic Progression or A.P.
x2x1=d{x_2} - {x_1} = d
And x3x2=d{x_3} - {x_2} = d
Here ddis the common difference, which is added to the term to get the next term.
Therefore, x2x1=x3x2{x_2} - {x_1} = {x_3} - {x_2}
2x2=x1+x3\Rightarrow 2{x_2} = {x_1} + {x_3}
The term 2x22{x_2} is always even for any value of x2{x_2}.
Therefore, the sum x1+x3{x_1} + {x_3} must be even.
The condition x1,x2,x3{x_1},{x_2},{x_3} to be in Arithmetic Progression is the sum x1+x3{x_1} + {x_3} should be even.
Step 2: Find the number of ways in which the sum x1+x3{x_1} + {x_3} is even
The sum x1+x3{x_1} + {x_3} is even when either x1{x_1}and x3{x_3} both are even or x1{x_1}and x3{x_3} both are odd.
Number of ways (or combination) in which x1,x3{x_1},{x_3}are selected so that the sum x1+x3{x_1} + {x_3}is even

=(combination of x1is even)×(combination of x2is even)+  (combination ofx1is odd)×(combination of x2is odd)  = ({\text{combination of }}{x_1}{\text{is even}}) \times \left( {{\text{combination of }}{x_2}{\text{is even}}} \right) + \\\ {\text{ }}({\text{combination of}}{x_1}{\text{is odd}}) \times \left( {{\text{combination of }}{x_2}{\text{is odd}}} \right) \\\

=C(1,1)×C(3,1)+C(2,1)×C(4,1) = C\left( {1,1} \right) \times C\left( {3,1} \right) + C\left( {2,1} \right) \times C\left( {4,1} \right)
Calculate the combinations using the formula: C(n,r)=n!r!(nr)!C\left( {n,r} \right) = \dfrac{{n!}}{{r!\left( {n - r} \right)!}}
=1!1!(11)!×3!1!(31)!+2!1!(21)!×4!1!(41)!= \dfrac{{1!}}{{1!\left( {1 - 1} \right)!}} \times \dfrac{{3!}}{{1!\left( {3 - 1} \right)!}} + \dfrac{{2!}}{{1!\left( {2 - 1} \right)!}} \times \dfrac{{4!}}{{1!\left( {4 - 1} \right)!}}
=1!1!(0)!×3!1!(2)!+2!1!(1)!×4!1!(3)!= \dfrac{{1!}}{{1!\left( 0 \right)!}} \times \dfrac{{3!}}{{1!\left( 2 \right)!}} + \dfrac{{2!}}{{1!\left( 1 \right)!}} \times \dfrac{{4!}}{{1!\left( 3 \right)!}}
The factorial n!=n×(n1)×(n2)×......×3×2×1n! = n \times \left( {n - 1} \right) \times \left( {n - 2} \right) \times ...... \times 3 \times 2 \times 1. Expand the factorial and solve it further.
=11(1)×3×2!1(2)!+2×1!1(1)!×4×3!1(3)!= \dfrac{1}{{1\left( 1 \right)}} \times \dfrac{{3 \times 2!}}{{1\left( 2 \right)!}} + \dfrac{{2 \times 1!}}{{1\left( 1 \right)!}} \times \dfrac{{4 \times 3!}}{{1\left( 3 \right)!}}
=1×3+2×4= 1 \times 3 + 2 \times 4
=11= 11
Thus, the number of ways in which the sum x1+x3{x_1} + {x_3}is even is 11.
Thus, the number of ways in which the x1,x2,x3{x_1},{x_2},{x_3} is in Arithmetic Progression is also 11.

Step 3: Find the total number of ways of selecting x1,x2,x3{x_1},{x_2},{x_3} cards one from each box.
Total number of ways (or combination) in which three cards x1,x2,x3{x_1},{x_2},{x_3} can be selected from box 1, box 2, and box 3 respectively

=(combination of one card x1 sellected from box1)×(combination of one card x2 sellected from box2)×  (combination of one card x3 sellected from box3)  = \left( {{\text{combination of one card }}{{\text{x}}_1}{\text{ sellected from box1}}} \right) \times \left( {{\text{combination of one card }}{{\text{x}}_2}{\text{ sellected from box2}}} \right) \times \\\ {\text{ }}\left( {{\text{combination of one card }}{{\text{x}}_3}{\text{ sellected from box3}}} \right) \\\

=C(3,1)×C(5,1)×C(7,1) = C(3,1) \times C\left( {5,1} \right) \times C\left( {7,1} \right)
Calculate the combinations using the formula: C(n,r)=n!r!(nr)!C\left( {n,r} \right) = \dfrac{{n!}}{{r!\left( {n - r} \right)!}}
=3!1!(31)!×5!1!(51)!×7!1!(71)!= \dfrac{{3!}}{{1!\left( {3 - 1} \right)!}} \times \dfrac{{5!}}{{1!\left( {5 - 1} \right)!}} \times \dfrac{{7!}}{{1!\left( {7 - 1} \right)!}}
=3!1!(2)!×5!1!(4)!×7!1!(6)!= \dfrac{{3!}}{{1!\left( 2 \right)!}} \times \dfrac{{5!}}{{1!\left( 4 \right)!}} \times \dfrac{{7!}}{{1!\left( 6 \right)!}}
The factorial n!=n×(n1)×(n2)×......×3×2×1n! = n \times \left( {n - 1} \right) \times \left( {n - 2} \right) \times ...... \times 3 \times 2 \times 1. Expand the factorial and solve it further.
=3×2!1(2)!×5×4!1(4)!×7×6!1(6)!= \dfrac{{3 \times 2!}}{{1\left( 2 \right)!}} \times \dfrac{{5 \times 4!}}{{1\left( 4 \right)!}} \times \dfrac{{7 \times 6!}}{{1\left( 6 \right)!}}
=3×5×7= 3 \times 5 \times 7
=105= 105
Thus, the total number of ways in which three cards x1,x2,x3{x_1},{x_2},{x_3} can be selected from box 1, box 2, and box 3 respectively is 105.
Step 4: Find the required probability.
Probability ( x1,x2,x3{x_1},{x_2},{x_3} in A.P) =number of favorable outcomestotal number of outcomes = \dfrac{{{\text{number of favorable outcomes}}}}{{{\text{total number of outcomes}}}}
=number of ways x1,x2,x3 cards are in A.P.total number of ways x1,x2,x3 cards are selected = \dfrac{{{\text{number of ways }}{{\text{x}}_1}{\text{,}}{{\text{x}}_2}{\text{,}}{{\text{x}}_3}{\text{ cards are in A}}{\text{.P}}{\text{.}}}}{{{\text{total number of ways }}{{\text{x}}_1}{\text{,}}{{\text{x}}_2}{\text{,}}{{\text{x}}_3}{\text{ cards are selected }}}}
=11105= \dfrac{{11}}{{105}}
The probability that x1,x2,x3{x_1},{x_2},{x_3} are in an arithmetic progression is 11105\dfrac{{11}}{{105}} .

Thus the correct option is (C).

Note: The probability of any event is always “greater than and equal to 0” and “less than and equal to 1”.
The set of all possible outcomes is called the sample space, S of the experiment. Any subset E of sample space S is called an event. The probability of an event, E is given by:
P(E) = n(E)n(S)\dfrac{{n(E)}}{{n(S)}}
Where n(E)n(E)is the number of elements in set E, n(S)n(S)is the number of elements in the set S.
The first term of A.P. is denoted by aa , the common difference by dd and the last term by ll.
The general term or nth{n^{th}} of the A.P is an=a+(n1)d{a_n} = a + \left( {n - 1} \right)d.