In India, there is an exam JEE-Mains which is taken by more than a million students. Here, there are 90 objective problems, each having 4 choices, out of which only 1 is correct. Each correct answer carries 4 marks, and each incorrect answer costs -1 marks. You get 0 marks for an unattempted problem.
Consider a very special student sitting in the exam. This student knows at least 1 of the problems correctly. The probability that he knows the correct answers to exactly k problems is directly proportional to k 1 . In each of the problems he doesn't know the answer to, there is an 80% chance that he marks it randomly and a 20% chance that he leaves it unanswered.
Find the greatest integer less than or equal to the expected marks of this student.
Details and assumptions
n = 1 ∑ 9 0 n 1 = 0 . 1 9 6 7 5 1 1 .
If he answers a problem randomly, the probability that he gets it correct is exactly 4 1 .
As any other student, if he knows the correct answer to a problem, he will mark it, i.e. he won't leave it unanswered.
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.
Typo: m = 1 / 0 . 1 9 6 7 5 1 1 = 0 . 1 9 6 7 5 1
This is exactly what I did. But instead I had rounded 1/0.196751 to approx 5 so I was getting answer as 86 instead. Great question though.
ok..thats a never before done thing....
it said that he know 1 question atleast so shouldn't we start from 2 ?
The probability of knowing exactly k problems is directly proportional to k 1 and hence, can be taken as k p . Now, if P k denotes the probability of knowing exactly k problems, then clearly,
k = 1 ∑ 9 0 P k = 1
⇒ p k = 1 ∑ 9 0 k 1 = 1 ⇒ p 0 . 1 9 6 7 5 1 1 = 1 ⇒ p = 0 . 1 9 6 7 5 1 .
Now let us consider the event E , that the student knows 9 0 − n problems, and does not know n problems. Out of these n problems , he attempts k problems , and of these k problems, m get correct.
Total marks = 4 ( 9 0 − n + m ) + ( − 1 ) ( k − m ) = 3 6 0 − 4 n + 5 m − k
The probability that he knows 9 0 − n problems is 9 0 − n p .
The probability that he marks k problems out of n is : ( k n ) ( 0 . 8 ) k ( 0 . 2 ) n − k
The probability that out of k problems, m get correct is: ( m k ) ( 0 . 2 5 ) m ( 0 . 7 5 ) k − m
Hence, the probability that event E occurs is 9 0 − n p × ( k n ) ( 0 . 8 ) k ( 0 . 2 ) n − k × ( m k ) ( 0 . 2 5 ) m ( 0 . 7 5 ) k − m .
The marks corresponding to event E are 3 6 0 − 4 n + 5 m − k .
Hence, the expected marks are :
M = n = 0 ∑ 8 9 k = 0 ∑ n m = 0 ∑ k ( 9 0 − n p × ( k n ) ( 0 . 8 ) k ( 0 . 2 ) n − k × ( m k ) ( 0 . 2 5 ) m ( 0 . 7 5 ) k − m ( 3 6 0 − 4 n + 5 m − k ) )
To evaluate this summation, we use following property :
r = 0 ∑ n r ( r n ) a r ( 1 − a ) n − r
= r = 0 ∑ n n a ( r − 1 n − 1 ) a r − 1 ( 1 − a ) ( n − 1 ) − ( r − 1 ) , by using r ( r n ) = n ( r − 1 n − 1 )
= n a ( a + 1 − a ) n − 1 = n a
Hence, m = 0 ∑ k m ( m k ) ( 0 . 2 5 ) m ( 0 . 7 5 ) k − m = 4 k ,
Also, ( 3 6 0 − 4 n − k ) m = 0 ∑ k ( 0 . 2 5 ) m ( 0 . 7 5 ) k − m = 3 6 0 − 4 n − k
⇒ M = n = 0 ∑ 8 9 k = 0 ∑ n ( 9 0 − n p × ( k n ) ( 0 . 8 ) k ( 0 . 2 ) n − k ( 3 6 0 − 4 n + 5 4 k − k ) ) ,
We use the same identity again to get:
M = n = 0 ∑ 8 9 9 0 − n p ( 3 6 0 − 4 n + 4 n × 0 . 8 )
= 3 6 0 p + 5 p n = 0 ∑ 8 9 9 0 − n n
= 3 6 0 p + 5 p ( 9 0 n = 0 ∑ 8 9 9 0 − n 1 − n = 0 ∑ 8 9 1 )
= 3 6 0 × 0 . 1 9 6 7 5 1 + 5 0 . 1 9 6 7 5 1 ( 0 . 1 9 6 7 5 1 9 0 − 9 0 ) = 8 5 . 2 8 8
Note: Since the student knows 9 0 − n problems, hence, n varies from 0 to 8 9
You can shorten your work greatly by using the linearity of conditional expectation.
Given that a student knows k answers, the expected score is k × 4 + ( 9 0 − k ) × ( 4 × . 2 + ( − 1 ) × . 6 + 0 × . 2 ) = 3 . 8 k + 1 8 .
Hence, the expected score is
E [ Score ] = ∑ P k E [ Score| know k answers ] = ∑ k p ( 3 . 8 k + 1 8 ) = 3 . 8 × p × 9 0 + 1 8 = 8 5 . 2 8 8 .
Log in to reply
That is great, and much short indeed!
But, that didn't seem obvious to me, as I have never studied something like linearity of conditional expectation. Can you please post a note on it?
Log in to reply
Jatin, even I don't know of any such thing. A post on it would be great. However, I used the same thing. The idea is:
By definition, expected score is the weighted mean of all the possible scores. The weights being the respective probabilities of getting that score. That is, for a score S(k) the probability of getting that score is P(k). So,
E [ Score ] = ∑ P ( k ) ∑ P ( k ) S ( k )
But obviously ∑ P ( k ) = 1 . Hence that expression!
@Calvin, if anything's wrong with my understanding, do tell!
Are you aware that there is already a post in the Practice section on expected values ?
Log in to reply
@Sreejato Bhattacharya – Thanks for the link - wasn't aware!
That's what I did to reach the final answer. I've never learned or been taught probability, beyond basics... multiplication and addition in probability theory is just intuitive to me.. Of course, I made two computation/copying errors along the way; otherwise I ran into no problems with this question.
Consider the probability with a fixed value of k .
Our student (S) expected value can be calculated as follows:
Clearly he will get at least k problems right, so he starts out with an expected value of 4 k .
Also, since S attempts 80% of problems S doesn't know, S attempts 5 4 ( 9 0 − k ) additional problems in which he randomly guesses.
When randomly guessing, the expected value is 4 1 ( 4 ) − 4 3 ( 1 ) = 4 1 marks.
Putting this together, the expected value given we know the value of k is...
4 k + 5 4 ( 9 0 − k ) ( 4 1 ) = 5 1 9 k + 9 0
The probability that k is a given value is 1 / k ÷ 1 / . 1 9 6 7 5 1 = k . 1 9 6 7 5 1 .
So, since k is not really given and is really a variable from 1 to 90, we have to factor in the probability that have that specific value of k into our previous expected value:
( k 0 . 1 9 6 7 5 1 ) ( 5 1 9 k + 9 0 )
Our answer is the sum of the individual expected values for all possible values of k :
∑ k = 1 9 0 ( k 0 . 1 9 6 7 5 1 ) ( 5 1 9 k + 9 0 )
Now we simplify:
( 0 . 1 9 6 7 5 1 ) ∑ k = 1 9 0 5 k 1 9 k + 9 0
( 0 . 1 9 6 7 5 1 ) { ∑ k = 1 9 0 3 . 8 + ∑ k = 1 9 0 k 1 8 }
( 0 . 1 9 6 7 5 1 ) { ∑ k = 1 9 0 3 . 8 + ( 1 8 ) ∑ k = 1 9 0 k 1 }
( 0 . 1 9 6 7 5 1 ) { ( 9 0 ) ( 3 . 8 ) + 0 . 1 9 6 7 5 1 1 8 }
0 . 1 9 6 7 5 1 ⋅ 9 0 ⋅ 3 . 8 + 1 8 ≈ 8 5
Problem Loading...
Note Loading...
Set Loading...
Let the probability that the student knows exactly k answers be given by k m , where m is a constant. Since the student must know a certain number of questions from 1 to 9 0 , it follows that k = 1 ∑ 9 0 k m = 1 ⟹ m ( k = 1 ∑ 9 0 k 1 ) = 1 ⟹ m = 1 / 0 . 1 9 6 7 5 1 1 = 0 . 1 9 6 7 5 1 1 . We thus conclude the probability of the student knowing precisely k questions is 0 . 1 9 6 7 5 1 × k . The expected number of questions the student knows is given by k = 1 ∑ 9 0 k k 0 . 1 9 6 7 5 1 = 9 0 × 0 . 1 9 6 7 5 1 = 1 7 . 7 0 7 5 9 . The expected number of questions the student doesn't know is 9 0 − 1 7 . 7 0 7 5 9 = 7 2 . 2 9 2 4 1 .
The expected marks the student gets from answering the questions he knows is 1 7 . 7 0 7 5 9 × 4 . The expected number of questions the student guesses is 5 4 × 7 2 . 2 9 2 4 1 . Out of these guesses, the expected number of marks he scores is 7 2 . 2 9 2 4 1 × 5 4 × 4 1 × 4 + 5 4 × 7 2 . 2 9 2 4 1 × 4 3 × ( − 1 ) .
Using Linearity of Expectation, we conclude the net expected score of the student is 1 7 . 7 0 7 5 9 × 4 + 7 2 . 2 9 2 4 1 × 5 4 × 4 1 × 4 + 5 4 × 7 2 . 2 9 2 4 1 × 4 3 × ( − 1 ) = 8 5 . 2 8 8 4 2 . Since the question asks for the largest integer smaller than this, our desired answer is 8 5 .