There are 4 students attending a test and 7 teachers available for checking the tests. Each student's test is checked by exactly one of these teachers, with each teacher being equally likely to be the one who checks the test. The probability that all the 4 papers are checked by exactly 3 teachers is equal to k ( 7 6 ) 2 . Find k .
Details: Each paper is checked by only 1 teacher.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice solution !
@Sahil Bansal @Mark Hennings I find this problem extremely confusing. Can you help me clear up what it states?
My current interpretation is that each teacher has a probability p of marking a paper, and that a paper could be marked multiple times.
It seems to me that your interpretation is "Each test is marked by exactly 1 teacher". If so, I don't think that's as yet obvious in the statement.
Log in to reply
Certainly my solution assumed that each script is marked once only.
"All 4 papers are checked by exactly 3 teachers" means that only 3 teachers are involved in the checking wherein each paper is checked by only 1 teacher.
Log in to reply
You have not made it clear that "Each paper is checked by exactly 1 teacher", which as Mark said is an implicit assumption.
Why can't it be that teacher 1 checked papers A, B, C, D, teacher 2 checked papers A, B, teacher 3 checked papers C, D. It still satisfies the condition " All papers (A, B, C, D) are checked by exactly 3 teachers (1, 2, 3)". In fact, by saying "probability that a particular teacher checks a particular paper is 1/7" further confuses the matter, since it would then be possible that 2 teachers checked the same paper.
Log in to reply
@Calvin Lin – Ok, I removed that p=1/7, .. actually the statement "The paper of each student can be checked by any one of the 7 teachers" itself means that each paper is checked by exactly 1 teacher.
Total no. of ways in which 4 papers can be checked = 7 ∗ 7 ∗ 7 ∗ 7 ( ∵ Each paper can be checked by any of the 7 teachers.)
For no. of favourable cases(when all 4 papers are checked by exactly 3 teachers), first of all we select the 3 teachers out of 7 in ( 3 7 ) ways.
Now, we consider the possible no of ways in which 4 papers can be checked by these 3 teachers. Possible no of ways= 3 ∗ 3 ∗ 3 ∗ 3
This will include the following cases(so they must be subtracted)-
i) All 4 papers are checked by exactly 2 teachers out of 3 chosen
ii)All 4 papers are checked by 1 teacher (3 such cases exist)
No of ways in which papers are checked by 2 teachers= ( 2 3 ) ∗ 2 ∗ 2 ∗ 2 ∗ 2 (first we selected 2 teachers out of 3) This also includes the case when papers are checked by only 1 teacher but this case is included 2 times here. Hence, no. of ways in which papers are checked by exactly 2 teachers out of 3 chosen= ( 2 3 ) ∗ 2 ∗ 2 ∗ 2 ∗ 2 − 6
∴ No of favourable cases = ( 3 7 ) ∗ ( 3 4 − ( ( 2 3 ) ∗ 2 4 − 6 ) − 3 ) = 3 5 ∗ 3 6
Hence, required probability= 7 ∗ 7 ∗ 7 ∗ 7 3 5 ∗ 3 6 = 7 5 ∗ ( 7 6 ) 2 So, k= 7 5 = 0 . 7 1 4 2 8 5
Another way of doing this is 7 4 ( 3 7 ) × ( 1 3 ) × 2 ! 4 ! where ( 3 7 ) is the number of ways of choosing 3 teachers out of 7, ( 1 3 ) is the number of ways of choosing the one teacher who will check two copies,and 2 ! 4 ! is the number of ways of permuting the sheets to be checked by the teacher,we divide by 2 ! as two sheets are to be checked by the same teacher,and 7 4 is the sample space.
Log in to reply
Yeah! Nice solution.
why cant we do like this...
3 teachers...so
7c3 ×(3c1 × 2c1 × 1c1 × 3c1 )
Log in to reply
This also makes sense but we must check whether this includes all the cases.
Problem Loading...
Note Loading...
Set Loading...
There are 7 4 ways of allocating the teachers to the scripts. If exactly 3 teachers do the marking, one must mark two scripts, and the other two one script each. There are 7 × ( 2 4 ) = 4 2 ways of choosing which two of the four scripts will be marked by the same teacher, and determining which teacher does this marking. There are then 6 ways of choosing the marker for the third script, and 5 ways of choosing the marker for the final script. Thus the probability is 7 4 4 2 × 6 × 5 = 7 3 5 × 6 2 making k = 7 5 .