Problems

Age
Difficulty
Found: 9

A convex polygon on a plane contains no fewer than \(m^2+1\) points with whole number co-ordinates. Prove that within the polygon there are \(m+1\) points with whole number co-ordinates that lie on a single straight line.

A fly crawls along a grid from the origin. The fly moves only along the lines of the integer grid to the right or upwards (monotonic wandering). In each node of the net, the fly randomly selects the direction of further movement: upwards or to the right. Find the probability that at some point:

a) the fly will be at the point \((8, 10)\);

b) the fly will be at the point \((8, 10)\), along the line passing along the segment connecting the points \((5, 6)\) and \((6, 6)\);

c) the fly will be at the point \((8, 10)\), passing inside a circle of radius 3 with center at point \((4, 5)\).

A fly moves from the origin only to the right or upwards along the lines of the integer grid (a monotonic wander). In each node of the net, the fly randomly selects the direction of further movement: upwards or to the right.

a) Prove that sooner or later the fly will reach the point with abscissa 2011.

b) Find the mathematical expectation of the ordinate of the fly at the moment when the fly reached the abscissa 2011.

In his laboratory, the Scattered Scientist created a unicellular organism, which, with a probability of 0.6 is divided into two of the same organisms, and with a probability of 0.4 dies without leaving any offspring. Find the probability that after a while the Scattered Scientist will not have any such organisms.

An ant goes out of the origin along a line and makes \(a\) steps of one unit to the right, \(b\) steps of one unit to the left in some order, where \(a > b\). The wandering span of the ant is the difference between the largest and smallest coordinates of the ant for the entire length of its journey.

a) Find the largest possible wandering range.

b) Find the smallest possible range.

c) How many different sequences of motion of the ant are there, where the wandering range is the greatest possible?

There are several squares on a rectangular sheet of chequered paper of size \(m \times n\) cells, the sides of which run along the vertical and horizontal lines of the paper. It is known that no two squares coincide and no square contains another square within itself. What is the largest number of such squares?

We are given 101 rectangles with integer-length sides that do not exceed 100.

Prove that amongst them there will be three rectangles \(A, B, C\), which will fit completely inside one another so that \(A \subset B \subset C\).