For each pair of real numbers \(a\) and \(b\), consider the sequence of numbers \(p_n = \lfloor 2 \{an + b\}\rfloor\). Any \(k\) consecutive terms of this sequence will be called a word. Is it true that any ordered set of zeros and ones of length \(k\) is a word of the sequence given by some \(a\) and \(b\) for \(k = 4\); when \(k = 5\)?
Note: \(\lfloor c\rfloor\) is the integer part, \(\{c\}\) is the fractional part of the number \(c\).
Prove that for any natural number \(a_1> 1\) there exists an increasing sequence of natural numbers \(a_1, a_2, a_3, \dots\), for which \(a_1^2+ a_2^2 +\dots+ a_k^2\) is divisible by \(a_1+ a_2+\dots+ a_k\) for all \(k \geq 1\).
In the magical land of Anchuria there is a drafts championship made up of several rounds. The days and cities in which the rounds are carried out are determined by a draw. According to the rules of the championship, no two rounds can take place in one city, and no two rounds can take place on one day. Among the fans, a lottery is arranged: the main prize is given to those who correctly guess, before the start of the championship, in which cities and on which days all of the round will take place. If no one guesses, then the main prize will go to the organising committee of the championship. In total, there are eight cities in Anchuria, and the championship is only allotted eight days. How many rounds should there be in the championship, so that the organising committee is most likely to receive the main prize?
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.
\(a_1, a_2, a_3, \dots\) is an increasing sequence of natural numbers. It is known that \(a_{a_k} = 3k\) for any \(k\). Find a) \(a_{100}\); b) \(a_{2022}\).