|
|
The solution is just a very little more difficult, that the first, which comes to mind.
I tried firstly to count these probabilities (those are C(M, m) * C(N-M, n-m) / C(N, n)), but seems, it is impossible with these constraints. what is the answer for these tests?
10 6 14
?
10 6 19
?
10 1 13
?
11 6 23
?
thanks beforehand.
I think:
1. 9
2. 12
3. 1
4. 13 Really appreciate these tests.
This problem is a little more difficult than I think :) ёпт, ну и условие=( Statement is more than clear. Solution is not that trivial. I can not understand this string "Help Vova to find such M, which maximizes the probability that exactly m out of n random passers-by speak Cantonese." What does it mean? This means exactly what is written - for any possible M there is some probability that, when taken n people out of N, exactly m of them will speak Cantonese. You want to estimate M in a way to maximize that probability. This is called maximum likelihood approach in statistics. |
|
|
