In a tournament, 100 wrestlers are taking part, all of whom have different strengths. In any fight between two wrestlers, the one who is stronger always wins. In the first round the wrestlers broke into random pairs and fought each other. For the second round, the wrestlers once again broke into random pairs of rivals (it could be that some pairs will repeat). The prize is given to those who win both matches. Find:
a) the smallest possible number of tournament winners;
b) the mathematical expectation of the number of tournament winners.
At the ball, there were \(n\) married couples. In each pair, the husband and wife are of the same height, but there are no two pairs of the same height. The waltz begins, and all those who came to the ball randomly divide into pairs: each gentleman dances with a randomly chosen lady.
Find the mathematical expectation of the random variable \(X\), “the number of gentlemen who are shorter than their partners”.
On weekdays, the Scattered Scientist goes to work along the circle line on the London Underground from Cannon Street station to Edgware Road station, and in the evening he goes back (see the diagram).
Entering the station, the Scientist sits down on the first train that arrives. It is known that in both directions the trains run at approximately equal intervals, and along the northern route (via Farringdon) the train goes from Cannon Street to Edgware Road or back in 17 minutes, and along the southern route (via St James Park) – 11 minutes. According to an old habit, the scientist always calculates everything. Once he calculated that, from many years of observation:
– the train going counter-clockwise, comes to Edgware Road on average 1 minute 15 seconds after the train going clockwise arrives. The same is true for Cannon Street.
– on a trip from home to work the Scientist spends an average of 1 minute less time than a trip home from work.
Find the mathematical expectation of the interval between trains going in one direction.
A sequence consists of 19 ones and 49 zeros, arranged in a random order. We call the maximal subsequence of the same symbols a “group”. For example, in the sequence 110001001111 there are five groups: two ones, then three zeros, then one one, then two zeros and finally four ones. Find the mathematical expectation of the length of the first group.
Four outwardly identical coins weigh 1, 2, 3 and 4 grams respectively.
Is it possible to find out in four weighings on a set of scales without weights, which one weighs how much?
Authors: B. Vysokanov, N. Medved, V. Bragin
The teacher grades tests on a scale from 0 to 100. The school can change the upper bound of the scale to any other natural number, recalculating the estimates proportionally and rounding up to integers. A non-integer number, when rounded, changes to the nearest integer; if the fractional part is equal to 0.5, the direction of rounding can be either up or down and it can be different for each question. (For example, an estimate of 37 on a scale of 100 after recalculation in the scale of 40 will go to \(37 \cdot 40/100 = 14.8\) and will be rounded to 15).
The students of Peter and Valerie got marks, which are not 0 and 100. Prove that the school can do several conversions so that Peter’s mark becomes b and Valerie’s mark becomes a (both marks are recalculated simultaneously).
Three cyclists travel in one direction along a circular track that is 300 meters long. Each of them moves with a constant speed, with all of their speeds being different. A photographer will be able to make a successful photograph of the cyclists, if all of them are on some part of the track which has a length of \(d\) meters. What is the smallest value of \(d\) for which the photographer will be able to make a successful photograph sooner or later?
We took several positive numbers and constructed the following sequence: \(a_1\) is the sum of the initial numbers, \(a_2\) is the sum of the squares of the original numbers, \(a_3\) is the sum of the cubes of the original numbers, and so on.
a) Could it happen that up to \(a_5\) the sequence decreases (\(a_1> a_2> a_3> a_4> a_5\)), and starting with \(a_5\) – it increases (\(a_5 < a_6 < a_7 <\dots\))?
b) Could it be the other way around: before \(a_5\) the sequence increases, and starting with \(a_5\) – decreases?
A grasshopper can make jumps of 8, 9 and 10 cells in any direction on a strip of \(n\) cells. We will call the natural number \(n\) jumpable if the grasshopper can, starting from some cell, bypass the entire strip, having visited each cell exactly once. Find at least one \(n > 50\) that is not jumpable.
One hundred gnomes weighing each 1, 2, 3, ..., 100 pounds, gathered on the left bank of a river. They cannot swim, but on the same shore is a rowing boat with a carrying capacity of 100 pounds. Because of the current, it’s hard to swim back, so each gnome has enough power to row from the right bank to the left one no more than once (it’s enough for any one of the gnomes to row in the boat, the rower does not change during one voyage). Will all gnomes cross to the right bank?