There are \(n\) random vectors of the form \((y_1, y_2, y_3)\), where exactly one random coordinate is equal to 1, and the others are equal to 0. They are summed up. A random vector a with coordinates \((Y_1, Y_2, Y_3)\) is obtained.
a) Find the mathematical expectation of a random variable \(a^2\).
b) Prove that \(|a|\geq \frac{1}{3}\).
An incredible legend says that one day Stirling was considering the numbers of Stirling of the second kind. During his thoughtfulness, he threw 10 regular dice on the table. After the next throw, he suddenly noticed that in the dropped combination of points there were all of the numbers from 1 to 6. Immediately Stirling reflected: what is the probability of such an event? What is the probability that when throwing 10 dice each number of points from 1 to 6 will drop out on at least one die?
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?
The number \(x\) is such that both the sums \(S = \sin 64x + \sin 65x\) and \(C = \cos 64x + \cos 65x\) are rational numbers.
Prove that in both of these sums, both terms are rational.
It is known that \(a = x+y + \sqrt{xy}\), \(b = y + z + \sqrt{yz}\), \(c = x + z + \sqrt{xz}\). where \(x > 0\), \(y > 0\), \(z > 0\). Prove that \(a + b + \sqrt{ab} > c\).
Prove that for any odd natural number, \(a\), there exists a natural number, \(b\), such that \(2^b - 1\) is divisible by \(a\).
Prove that for any positive integer \(n\), it is always possible to find a number, consisting of the digits \(1\) and \(2,\) that is divisible by \(2^n\). (For example, \(2\) is divisible by \(2\), \(12\) is divisible by \(4,\) \(112\) is divisible by \(8,\) \(2112\) is divisible by \(16\) and so on...).
A sequence of natural numbers \(a_1 < a_2 < a_3 < \dots < a_n < \dots\) is such that each natural number is either a term in the sequence, can be expressed as the sum of two terms in the sequence, or perhaps the same term twice. Prove that \(a_n \leq n^2\) for any \(n=1, 2, 3,\dots\)
Out of the given numbers 1, 2, 3, ..., 1000, find the largest number \(m\) that has this property: no matter which \(m\) of these numbers you delete, among the remaining \(1000 - m\) numbers there are two, of which one is divisible by the other.
Let’s call a natural number good if in its decimal record we have the numbers 1, 9, 7, 3 in succession, and bad if otherwise. (For example, the number 197,639,917 is bad and the number 116,519,732 is good.) Prove that there exists a positive integer \(n\) such that among all \(n\)-digit numbers (from \(10^{n-1}\) to \(10^{n-1}\)) there are more good than bad numbers.
Try to find the smallest possible \(n\).