A Mathematical Proof of the Strong Goldbach’s Conjecture
Current Research in Statistics & Mathematics · 19.01.2026 · 5 (1) · 01-06
DOI: 10.33140/crsm.05.01.02 ↗Kurz gefasst
Fachartikel in der Zeitschrift Current Research in Statistics & Mathematics, online erschienen am 19.01.2026. Verfasst von Vassilly Voinov.
Abstract (Originalsprache)
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
Zitieren
APA
Voinov, V. (2026). A Mathematical Proof of the Strong Goldbach’s Conjecture. Current Research in Statistics & Mathematics, 5(1), 01-06. https://doi.org/10.33140/crsm.05.01.02
Vancouver
Voinov V. A Mathematical Proof of the Strong Goldbach’s Conjecture. Current Research in Statistics & Mathematics. 2026;5(1):01-06. doi:10.33140/crsm.05.01.02
BibTeX
@article{Voinov2026,
author = {Voinov, Vassilly},
title = {A Mathematical Proof of the Strong Goldbach’s Conjecture},
journal = {Current Research in Statistics & Mathematics},
year = {2026},
volume = {5},
number = {1},
pages = {01--06},
doi = {10.33140/crsm.05.01.02}
}
EUVIMED