 # Solving two problems in number theory

Annotation: in 1995, Olivier Ramaret proved that any even number is the sum of no more than 6 primes. From the validity of Goldbach's ternary hypothesis (proved in 2013 year) it follows that any even number is the sum of not more than 4 numbers. In the article, the author confirms the above and proves that the cause and effect of this is any even number the sum of not more than two prime and twin primes are infinite. ( Literature: -) Keywords: solving two problems in number theory
Theorem1. Any even number starting from 12 is representable as a sum four odd prime numbers. 1. For the first even number 12 = 3+3+3+3. We allow justice for the previous N 5: p1 + p2 + p3 + p4 =2N (3) We will add to both parts on 1 p1 + p2 + p3 + p4 + 1 = 2N + 1 (4) where on the right the odd number also agrees p1 + p2 + p3 + p4 + 1 = p5 + p6 + p7 (5) Having added to both parts still on 1 p1 + p2 + p3 + p4 + 2 = p5 + p6 + p7 + 1 (6) We will unite p6 + p7 + 1 again we have some odd number, which according to(1)we replace with the sum of three simple and as a result we receive: p1 + p2 + p3 + p4 + 2 = p5 + p6 + p7 + p8 (7) at the left the following even number is relative (3), and on the right the sum four prime numbers. p1 + p2 + p3 + p4 = 2N (8) Thus obvious performance of an inductive mathematical method. As was to be shown. And the sum of all sorts of odd number we have any even number, starting from 18: p1 + p2 + p3 + p4 + p5 + p6 =2N (9) From (8),(9) it follows: p1 + p2 + p3 + p4 + p5 + p6 = p7 + p8 + p9 + p10 (10) p1 + p2 + p3 + p4 + p5 + p6 =2N (11) where 2N⩾18, N⩾9 p11 + p12 + p13 + p14 = 2N1 (12) where 2N1⩾12, N1⩾6 Since N and N1 have all possible values, then: 2N − 2N1 = p7 + p8 (13) Which means the sum of six odd primes is equivalent to sum, where two primes from the sum of four and :
p11 + p12 + p13 + p14 = p9 + p10 (14) Thus, from (14) it follows that the sum of four primes is equal to the sum of two simple and make sure that (14) is true from left to right. Let be : p11+p12+ p13+ p14≠p9 +p10 (15) And since the sum of two odd prime numbers is an even number, equal to Since it is impossible to deny any pair of any two even numbers (13), then it turns out that the sum of six arbitrary odd primes is not equal to the sum of four arbitrary odd primes (10), which is also impossible. From what follows the inevitability of the equality of the sum of four primes to the sum of two primes. Thus, the equality of the sum of six primes and four is equivalent to the equality of the sum of four odd primes two and is equal to 2N, where 2N≥18 and the equality of the sum of 6 and 4 primes to any even number is a consequence of the equality to any even number of the sum of two primes and vice versa. An even number greater than or equal to 18, which cannot be summed up to 6 simple odd numbers do not exist. Representation of even numbers from 6 to 18 (minimum sum of 6 odd prime numbers) we show arithmetically with two odd prime numbers. Any even number starting with six is the sum of two prime numbers. The GoldbachEuler conjecture is correct and proven. 3.Thus we proved: Any even number since 6 is representable in the form of a bag of two odd the simple. p1 + p2 = 2N (16) Any even number is representable in the form of the sum of two simple. In total even numbers, without exception, since 6 are the sum of two prime numbers. Goldbakha-Euler's problem is true and proved! Theorem the four simple and the Goldbach Euler conjecture have a series of corollary. One of which is relevant problem in number theory. Corollary . If the sum of two primes from the sum of four 2N, starting from 12, set in the open interval [6, 2N - 6], then the sum the remaining two simple variables are the required even number. What can be seen from the proven Goldbach-Euler hypothesis. The prime numbers of twins are infinite. Any even number, starting from 14, can be represented as a sum
four odd primes, of which two primes are twins. p1 + p2 + p3 + p4 = 2 N (17) Let p3, p4. . prime numbers be twins, then the difference is any even, starting at 14, and the sum of the primes of the twins is also an even number, which, according to the proved Goldbach-Euler hypothesis, is equal to the sum of two prime numbers (Corollary ). Next, we place the prime numbers from left to right in descending order. And if the even number 2 N = 2 p2 + 2 p4 + 4 , then p1 , p2 . inevitably also twins. Subtract the sum from both parts (17) 2 p2 + 2 p4 : p1− p2 + p3 − p4 = 4 (18) From (18), it is obvious - inevitably twins. Let their finite number and the last prime numbers be twins p3, p4. . . Denote two primes greater than p3, p4. . how p1 , p2 . . Sum up all four primes and then according to the sum theorem four simple there is an even number 2 N at which inevitably large p1 , p2 . - twins. And then substituting p3, p4. . numeric values instead p1 , p2 . in (17) the process becomes infinite and the prime numbers are twins - infinite number. Literature:  Chen, J.R. "On the Distribution of Almost Primes in an Interval."Sci. Sinica18, 611-627, 1975.  Euler, L. "De numeris primis valde magnis."Novi Commentarii academiae scientiarum Petropolitanae9, 99-153, (1760) 1764. Reprinted in Commentat. arithm.1, 356-378, 1849. Reprinted in Opera Omnia: Series 1, Volume 3, pp.1-45. Goldman, J.R.The Queen of Mathematics: An Historically Motivated Guide to Number Theory.Wellesley, MA: A K Peters, p.22, 1998. Hardy, G.H. and Wright, W.M. "Unsolved Problems Concerning Primes." §2.8 and Appendix §3 in An Introduction to the Theory of Numbers, 5th ed.Oxford, England: Oxford University Press, pp.19 and 415-416, 1979. Iwaniec, H. and Pintz, J. "Primes in Short Intervals."Monatsh. f. Math.98, 115- 143, 1984. Sloane, N.J.A. Sequences A002496/M1506, A005574/M1010, and A007491/M1389 in "The On-Line Encyclopedia of Integer Sequences." . Lamb E. Goldbach Variations [Text]/ E.Lamb Scientific American blogs — May 15, 2013