MATHEMATICAL MODELING
Prime number law. Dependence of prime numbers on their ordinal numbers and Goldbach–Euler binary problem using computer
S. I. Chermidov Kuban State University,
Krasnodar, Russian Federation
Abstract:
The article considers the methods of defining and finding the distribution of composite numbers
$CN$, prime numbers
$PN$, twins of prime numbers
$Tw$ and twins of composite numbers
$TwCN$ that do not have divisors
$2$ and
$3$ in the set of natural numbers —
$\mathbb{N}$ based on a set of numbers like $\Theta=\{6\cdot\kappa\pm1, \kappa\in\mathbb{N}\}$, which is a semigroup in relation to multiplication. There has been proposed a method of obtaining primes
$p\geqslant 5$ by using their ordinal numbers in the set of primes
$p\geqslant 5$ and vice versa, as well as a new algorithm for searching and distributing primes based on a closedness of the elements of the set
$\Theta$. It has been shown that a composite number
$n\in\Theta$ can be presented in the form of products
$(6x \pm 1) (6y \pm 1)$, where
$x, y \in\mathbb{N}$ — are positive integer solutions of one of the
$4$ Diophantine equations:
$P(x, y, \lambda)=6xy\pm x\pm y-\lambda=0$. It has been proved that if there is a parameter
$\lambda$ of prime twins, then none of Diophantine equations
$P (x, y, \lambda) = 0$ has positive integer solutions. There has been found the new distribution law of prime numbers
$\pi(x)$ in the segment
$[1 \div N]$. Any even number
$\zeta>8$ is comparable to one of the numbers
$m=(0, 2, -2)$, i.e.
$\zeta\equiv m\pmod 6$. According to the above remainders
$m$, even numbers
$\zeta>8$ are divided into
$3$ types, each type having its own way of representing sums of
$2$ elements of the set
$\Theta$. For any even number
$\zeta>8$ in a segment
$[1 \div\nu]$, where
$\nu = (\zeta-m) / 6$, there is a parameter of an even number; it is proved that there is always a pair of numbers
$(\lambda_1, \lambda_2)\in[1\div \nu]$ that are elements of the united sets of parameters of prime twins
$\Pi_{tw}$ and parameters of transition numbers
$\Pi_{UPC}$, i.e. numbers of the form
$6\lambda\pm1$ with the same
$\lambda$, if the form
$6\lambda-1$ is a prime number, then the form
$6\lambda+1$ is a composite number, and vice versa.
Keywords:
prime and composite numbers, parameters of primes, Diophantine equations, binary (strong) Goldbach–Euler, algorithm for solving the binary Goldbach–Euler problem.
UDC:
511.1:004.056
Received: 23.01.2020
Language: English
DOI:
10.24143/2072-9502-2020-4-80-100