A discussion of computer solvable problem on even Goldbach conjecture(I)
Lin Bo-gang · Fuzhou daxue xuebao. Ziran kexue ban · 2001
Based on the theory of recursive computability, the proposition of computer solvable on even Goldbach conjecture is proposed. At first, the project is converted into studding first type proposition of whether universal arrangement of even number N exists or not, i.e. whether it exists in B(2n) prime matrix. In this paper, we design and construct a basic (mod N) existence model, and propose a set of new concept of complementary theory for complete complementation. We then constructively prove unique existentiality of even number N, and give consequent conclusions. When any given positive even number N≥6, there will surely exist prime complete complementation (mod N(P)) or regular prime complete complementation (mod +N(P)). i.e.