I was practicing my probability and came across this question which i couldn't solve.
A particular professor is known for his arbitrary grading policies. Each paper receives a grade
from the set {A, A−, B+, B, B−, C+}, with equal probability, independently of other papers.
How many papers do you expect to hand in before you receive each possible grade at least once?
My first approach was to consider the random variable Xi which denotes the number of papers before the ith and the (i−1)th grade the the total number of papers would be X=1+ΣXi.But i cant proceed further.
Could someone please help me understand how to solve this question?
Answer
E(1+X1+⋯+X5)=1+EX1+⋯+EX5
Here Xi stands for the number of papers to hand in after i different gradings are received to come to i+1 gradings received. It is geometrically distributed with parameter 6−i6 so that EXi=66−i.
No comments:
Post a Comment