mersenneforum.org 6-line proof of the binary Goldbach conjecture for even integers congruent to 2 mod 4.
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2022-10-16, 13:35 #1 Tatenda   Oct 2022 13 Posts 6-line proof of the binary Goldbach conjecture for even integers congruent to 2 mod 4. There is a somehow forgotten but elegant identify of Buchstab on the number of Goldbach partitions. By exploiting that identity, we demonstrate within 6 lines that every even integer congruent to 2 mod 4 can be expressed as a sum of two odd primes. This proves the binary Goldbach conjecture for the specified integers. Kindly see: https://figshare.com/articles/prepri...cture/21342042 Presumably, the reason why the identity has been forgotten, is that it's quite difficult to treat analytically, hence numbee theorists shifted focus to other approaches, most notably the circle method. Your constructive comments are most welcome. Regards, Tatenda. Last fiddled with by masser on 2022-10-16 at 14:32 Reason: Moved Post to Math forum, where it seems more appropriate.
 2022-10-16, 15:03 #2 R. Gerbicz     "Robert Gerbicz" Oct 2005 Hungary 64B16 Posts Have you lost your arxiv account ? And I would strongly suggest to return to the Millenium prize problems (https://en.wikipedia.org/wiki/Millennium_Prize_Problems), and leave the easy problems for us.
 2022-10-16, 21:12 #3 Tatenda   Oct 2022 13 Posts I will indeed post on arXiv. Only that Figshare is much quicker.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Hugo1177 Miscellaneous Math 1 2021-01-13 22:15 Awojobi Miscellaneous Math 221 2019-10-02 08:33 MathDoggy Miscellaneous Math 9 2019-04-13 16:13 vector Miscellaneous Math 5 2007-12-01 14:43

All times are UTC. The time now is 16:00.

Sat Jan 28 16:00:57 UTC 2023 up 163 days, 13:29, 0 users, load averages: 1.03, 1.05, 1.22

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔