Let 2m>2, m∈ℤ, be the given even number of the Strong Goldbach Conjecture Problem. Then, m can be called the median of the problem. So, all Goldbach partitions (p,q)exist a relationship, p=m−dand q=m+d, where p≤q...Let 2m>2, m∈ℤ, be the given even number of the Strong Goldbach Conjecture Problem. Then, m can be called the median of the problem. So, all Goldbach partitions (p,q)exist a relationship, p=m−dand q=m+d, where p≤qand d is the distance from m to either p or q. Now we denote the finite feasible solutions of the problem as S(2m)={ (2,2m−2),(3,2m−3),⋅⋅⋅,(m,m) }. If we utilize the Eratosthenes sieve principle to efface those false objects from set S(2m)in pistages, where pi∈P, pi≤2m, then all optimal solutions should be found. The Strong Goldbach Conjecture is true since we proved that at least one optimal solution must exist to the problem. The Weak Goldbach Conjecture is true since it is a special case of the Strong Goldbach Conjecture. Therefore, the Goldbach Conjecture is true.展开更多
This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the incl...This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the inclusion of the zero element as the source of a strong Goldbach conjecture reformulation. A prime Boolean vector is defined, pinpointing the positions of prime numbers within the odd number sequence. The natural unit primality is discussed in this context and transformed into a source of quantum-like indetermination. This approach allows for rephrasing the strong Goldbach conjecture, framed within a Boolean scalar product between the prime Boolean vector and its reverse. Throughout the discussion, other intriguing topics emerge and are thoroughly analyzed. A final description of two empirical algorithms is provided to prove the strong Goldbach conjecture.展开更多
文摘Let 2m>2, m∈ℤ, be the given even number of the Strong Goldbach Conjecture Problem. Then, m can be called the median of the problem. So, all Goldbach partitions (p,q)exist a relationship, p=m−dand q=m+d, where p≤qand d is the distance from m to either p or q. Now we denote the finite feasible solutions of the problem as S(2m)={ (2,2m−2),(3,2m−3),⋅⋅⋅,(m,m) }. If we utilize the Eratosthenes sieve principle to efface those false objects from set S(2m)in pistages, where pi∈P, pi≤2m, then all optimal solutions should be found. The Strong Goldbach Conjecture is true since we proved that at least one optimal solution must exist to the problem. The Weak Goldbach Conjecture is true since it is a special case of the Strong Goldbach Conjecture. Therefore, the Goldbach Conjecture is true.
文摘This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the inclusion of the zero element as the source of a strong Goldbach conjecture reformulation. A prime Boolean vector is defined, pinpointing the positions of prime numbers within the odd number sequence. The natural unit primality is discussed in this context and transformed into a source of quantum-like indetermination. This approach allows for rephrasing the strong Goldbach conjecture, framed within a Boolean scalar product between the prime Boolean vector and its reverse. Throughout the discussion, other intriguing topics emerge and are thoroughly analyzed. A final description of two empirical algorithms is provided to prove the strong Goldbach conjecture.
