Answers are grounded in this paper and cite their sources.
This work presents a formal proof of Goldbach conjecture based on a novel theory of Mirror-Prime Decomposition (MPD) for arbitrary even integers. A new concept of mirror primes is introduced as a set of pairs of primes that are symmetrically adjacent to any pivotal even number on both sides in finite distance k bounded by 1 k (ne/2) -2. As a counterpart of the Euclidean Fundamental Theorem of Arithmetic for natural number factorization, the MPD theory enables arbitrary even number decomposition by mirror primes. MPD paves a way to prove the Goldbach conjecture, i.e., where denoted by the big-R calculus for representing recursive structures and manipulating recursive functions. An algorithm of Goldbach conjecture testing is designed for demonstrating the formal proof of the Goldbach theorem. i.e where denoted by the big-R calculus for representing recursive structures and manipulating recursive functions. An algorithm of Goldbach conjecture testing is designed for demonstrating the formal proof of the Goldbach theorem.
No takes yet. Share an insight, caveat, or question.
Yingxu Wang (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: