There are an infinite number of pars of prime numbers

Бесплатный доступ

The article deals with one of the oldest mathematical problems, the existence of pairs of prime numbers of the form , ,, this problem has a long history of finding solutions. One of these results is the result proved by Brun in 1919: "A series of quantities, the inverse of simple twins, breaks off or converge," also such a result is the achievement of Jan Iten, who in 2013 proved that: "that there are infinitely many pairs of consecutive primes with a difference of no more than 70 million." Further, this result was improved in 2014 by Pace Nielsen from Brigham Young University in Utah - 246. My solution is not a continuation of the work of Jan Iten, but is an alternative way to solve this problem. This solution will be described below and implies the solution of this problem in a broader sense, where the problem of simple twins is only a special case, more details about this will be described in another article, and in this one it will be a speech.

Еще

Building sequences, symmetric residues, complete combinations of residuals, epicycloids, numbering of combinations

Короткий адрес: https://sciup.org/170197655

IDR: 170197655   |   DOI: 10.24412/2500-1000-2023-1-2-182-199

Статья научная