Question
Question: A person has 6 cards A, K, 2, Q, 10, 9. The person randomly draws the cards one by one with replacem...
A person has 6 cards A, K, 2, Q, 10, 9. The person randomly draws the cards one by one with replacement till he gets 3 consecutive A. If Pn represents the probability that atleast n cards are drawn, then 216Pn−5Pn−3−30Pn−2−180Pn−1 is (For n > 3)

0
0
Solution
Let the process be such that a card is drawn with replacement until three consecutive A’s appear. Define the state probabilities after n draws as follows:
- Let un = probability the process is active and ends in “non-A” (0 consecutive A’s),
- vn = probability the process is active and ends in “A” (1 consecutive A),
- wn = probability the process is active and ends in “AA” (2 consecutive A’s),
with initial conditions u0 = 1, v0 = 0, w0 = 0.
At every draw:
- If a non-A card is drawn (with probability 5/6), the process goes to state 0 regardless of the previous state.
- If an A is drawn (with probability 1/6):
- From state 0, it goes to state 1,
- From state 1, to state 2,
- From state 2, drawing A would complete three A’s so the process stops.
Thus, the recurrences are:
⎩⎨⎧un=65(un−1+vn−1+wn−1)=65f(n−1),vn=61un−1,wn=61vn−1.
where f(n)=un+vn+wn is the probability that no three consecutive A’s are obtained in n draws.
Then,
f(n)=65f(n−1)+61un−1+61vn−1.
Since un−1=65f(n−2) and vn−1=61un−2=365f(n−3), we have:
f(n)=65f(n−1)+365f(n−2)+2165f(n−3).
Multiplying both sides by 216 yields:
216f(n)=180f(n−1)+30f(n−2)+5f(n−3).
Now note that "at least n cards are drawn" means that in the first n−1 draws, the process has not stopped. Define:
Pn=f(n−1).
Substitute n−1 for n in the recurrence:
216f(n−1)=180f(n−2)+30f(n−3)+5f(n−4),
or, writing in terms of P,
216Pn=180Pn−1+30Pn−2+5Pn−3.
Rearrange to obtain:
216Pn−5Pn−3−30Pn−2−180Pn−1=0,
for n>3.