On Distribution of Prime Numbers
The sieve of Eratosthenes as repeatable rows of odd numbers is analyzed in the paper. For each regular prime number Р1 a row of odd numbers is represented by an alternation of its smallest facients (>1, but <Р1) by 1 of the number. The longest alternation of the first prime odd numbers <Р1 has been defined. There has been calculated that from Р1 to Р1 2 any (Р2 –1) odd numbers in succession contain at least two prime numbers.