Algorithm of the optimum choice of the girl for joint carrying out New Year.
Suppose you come to a party or club to celebrate the New Year. Naturally there will be girls without a couple. You want to meet. Suppose, according to statistics, the most beautiful girl will fail with a probability of 50%. Every less pretty person will say “yes” with a greater probability + 5% from the previous one. At the same time, the refusal of each girl lowers the probability of the next one by -5%, and consent, on the contrary, + 5%. The task is to calculate the algorithm in order to meet the prettiest girl in the minimum number of iterations.
We are trying to get acquainted with the most beautiful girl.
If you said yes, then we complete the task.
If she said no, then we go to another party / to another club. And go to the 1st paragraph.
Moral - for the New Year it's better to forget about the theory of probability :)