Every Friday ten gentlemen come to the club, and each one gives the doorman his hat. Each hat is just right for its owner, but there are no two identical hats. The gentlemen leave one by one in a random order.
Seeing off the next gentleman, the club’s doorman tries to put the first hat that he grabs on the gentleman’s head. If it fits (not necessarily perfectly), the gentleman leaves with that hat. If it is too small, the doorman tries the next random hat from the remaining ones. If all of the remaining hats turned out to be too small, the doorman says to the poor fellow: “Sir, you do not have a hat today,” and the gentleman goes home with his head uncovered. Find the probability that next Friday the doorman will not have a single hat.
Two hockey teams of the same strength agreed that they will play until the total score reaches 10. Find the mathematical expectation of the number of times when there is a draw.
A table of size \(3 \times 3\) (as for playing tic-tac-toe) is given. Four chips are put (one each) on four randomly selected cells. Find the probability that among these four chips there are three that stand in a row vertically, horizontally or diagonally.
A ticket for a train costs 50 pence, and the penalty for a ticketless trip is 450 pence. If the free rider is discovered by the controller, he pays both the penalty and the ticket price. It is known that the controller finds the free rider on average once out of every 10 trips. The free rider got acquainted with the basics of probability theory and decided to adhere to a strategy that gives the mathematical expectation of spending the smallest possible. How should he act: buy a ticket every time, never buy one, or throw a coin to determine whether he should buy a ticket or not?
Chess board fields are numbered in rows from top to bottom by the numbers from 1 to 64. 6 rooks are randomly assigned to the board, which do not capture each other (one of the possible arrangements is shown in the figure). Find the mathematical expectation of the sum of the numbers of fields occupied by the rooks.
A toy cube is symmetrical, but it’s unusual: two faces have two points, and the other four have one point. Sarah threw the cube several times, and as a result, the sum of all of the points was 3. Find the probability that one throw resulted in the face with 2 points coming up.
The teacher on probability theory leaned back in his chair and looked at the screen. The list of those who signed up is ready. The total number of people turned out to be \(n\). Only they are not in alphabetical order, but in a random order in which they came to the class.
“We need to sort them alphabetically,” the teacher thought, “I’ll go down in order from the top down, and if necessary I’ll rearrange the student’s name up in a suitable place. Each name should be rearranged no more than once”.
Prove that the mathematical expectation of the number of surnames that you do not have to rearrange is \(1 + 1/2 + 1/3 + \dots + 1/n\).
In a shopping centre, three machines sell coffee. During the day, the first machine can break down with a probability of 0.4 and the second with a probability of 0.3. Every evening, Mr Ivanov, the mechanic, comes and repairs all of the broken-down coffee machines. One day, Ivanov wrote, in his report, that the mathematical expectation of breakdowns during one week is 12. Prove that Mr Ivanov is exaggerating.
When one scientist comes up with an ingenious idea, he writes it down on a piece of paper, but then he realises that the idea is not brilliant, scrunches up this sheet of paper and throws it under the table, where there are two rubbish bins. The scientist misses the first bin with a probability \(p > 0.5\), and with the same probability he misses the second. In the morning, the scientist threw five crumpled brilliant ideas under the table. Find the probability that there was at least one of these ideas in each bin.
The television game “What? Where? When?” consists of a team of “experts” trying to solve 13 questions (or sectors), numbered from 1 to 13, that are thought up and sent in by the viewers of the programme. Envelopes with the questions are selected in turn in random order with the help of a spinning top with an arrow. If this sector has already come up previously, and the envelope is no longer there, then the next clockwise sector is played. If it is also empty, then the next one is played, etc., until there is a non-empty sector.
Before the break, the players played six sectors.
a) What is more likely: that sector number 1 has already been played or that sector number 8 has already been plated?
b) Find the probability that, before the break, six sectors with numbers from 1 to 6 were played consecutively.