|
MATHEMATICAL MODELING
Proceedure for solving Goldbach–Euler problem using the numbers of a special type
S. I. Chermidov Kuban State University
Abstract:
Since the elements are closed, the set $\Theta=\{6\lambda\pm1; \lambda\in N\}$, is a semigroup with respect
to the operation of multiplication. The paper focuses on presenting even numbers $\zeta>8$ in the
form of sums of two elements: $\theta_1=6\lambda_1\pm1$ and $\theta_2=6\lambda_2\pm1$ from the set $\Theta$. Any even number $\zeta>8$
is comparable with one of the numbers $m = (0, 2, -2)$, according to $\pmod 6$. According to the remnants
listed $m$, even numbers $\zeta>8$ are divided into $3$ types. Each type has its own way of presenting
sums in the form of two elements from the set $\Theta$. For any even number $\zeta>8$ on the segment
$[1\div\nu]$ there is always at least a pair of numbers $(\lambda_1, \lambda_2)\in [1\div\nu]$, that both are elements from the
union of sets: the parameters of the prime numbers (twins) and the parameters (composite and
prime) of numbers $\Theta$. A variant of the solution of Goldbach–Euler conjecture for even numbers
$\zeta>8$ is given on the set of primes $P$. Goldbach–Euler conjecture is also solvable in the set
of prime numbers (twins), if the parameters of numbers $\theta_1$ and $\theta_2$, i.e. $\lambda_1$ and $\lambda_2$ belong to the set $N \setminus FN$,
where $FN$ is the set of parameters of the composite numbers $\Theta$ on the segment $[1\div\nu]$.
Keywords:
Goldbach–Euler binary problem, algorithm for solving, numbers of a special type.
Received: 24.10.2017
Citation:
S. I. Chermidov, “Proceedure for solving Goldbach–Euler problem using the numbers of a special type”, Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics, 2018, no. 1, 121–128
Linking options:
https://www.mathnet.ru/eng/vagtu524 https://www.mathnet.ru/eng/vagtu/y2018/i1/p121
|
Statistics & downloads: |
Abstract page: | 238 | Full-text PDF : | 67 | References: | 22 |
|