Author: I.I. Bogdanov
Peter wants to write down all of the possible sequences of 100 natural numbers, in each of which there is at least one 3, and any two neighbouring terms differ by no more than 1. How many sequences will he have to write out?
Author: I.I. Bogdanov
Peter wants to write down all of the possible sequences of 100 natural numbers, in each of which there is at least one 4 or 5, and any two neighbouring terms differ by no more than 2. How many sequences will he have to write out?
On the occasion of the beginning of the winter holidays all of the boys from class 8B went to the shooting range. It is known that there are \(n\) boys in 8B. There are \(n\) targets at the shooting range which the class attended. Each of the boys randomly chooses a target, while some of the boys could choose the same target. After this, all of the boys simultaneously attempt to shoot their target. It is known that each of the boys hits their target. The target is considered to be affected if at least one boy has hit it.
a) Find the average number of affected targets.
b) Can the average number of affected targets be less than \(n/2\)?
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.
At a contest named “Ah well, monsters!”, 15 dragons stand in a row. Between neighbouring dragons the number of heads differs by 1. If the dragon has more heads than both of his two neighbors, he is considered cunning, if he has less than both of his neighbors – strong, the rest (including those standing at the edges) are considered ordinary. In the row there are exactly four cunning dragons – with 4, 6, 7 and 7 heads and exactly three strong ones – with 3, 3 and 6 heads. The first and last dragons have the same number of heads.
a) Give an example of how this could occur.
b) Prove that the number of heads of the first dragon in all potential examples is the same.
Author: G. Zhukov
The square trinomial \(f (x) = ax^2 + bx + c\) that does not have roots is such that the coefficient \(b\) is rational, and among the numbers \(c\) and \(f (c)\) there is exactly one irrational.
Can the discriminant of the trinomial \(f (x)\) be rational?
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?
At what value of \(k\) is the quantity \(A_k = (19^k + 66^k)/k!\) at its maximum?
At what value of \(k\) is the quantity \(A_k = (19^k + 66^k)/k!\) at its maximum? You are given a number \(x\) that is greater than 1. Is the following inequality necessarily fulfilled \(\lfloor \sqrt{\!\sqrt{x}}\rfloor = \lfloor \sqrt{\!\sqrt{x}}\rfloor\)?
Prove that the sequence \(x_n = \sin (n^2)\) does not tend to zero for \(n\) that tends to infinity.