A Mathematical Proof of the Strong Goldbach’s Conjecture
Abstract
A proof of Goldbach’s conjecture based on the additive number theory and the theory of B-trees is presented. A core idea of the proof is the partitioning of a set of primes into parts with exactly two elements that are bounded subsets summed to a given even integer n > 2. An algorithm realizing the idea is suggested. For illustration, the R-script of the algorithm is appended. Results of this research also confirm the fact that the proposed approach for constructing Goldbach’s pairs is in complexity class P
Fields of Study & Subjects
Analytic Number Theory Research
Smarandache Functions and Recreational Number Theory
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Current Research in Statistics & Mathematics
- Volume
- 5
- Issue
- 1
- Pages
- 01–06
- Publication date
- 19 January 2026
- Language
- EN