Published October 20, 2026
| Version v1
Preprint
Open
Deterministic Proof of Goldbach's Conjecture via Spatial Shift
Authors/Creators
Description
The paper presents a spatial approach to numbers, providing a deterministic and constructive proof of Goldbach's conjecture. By arranging even numbers into two counter-directional odd sequences, the author demonstrates an algorithmic spatial shift that guarantees a strictly defined lower bound for the number of representations. The resulting formula shows that the number of Goldbach pairs grows continuously and never drops to zero, resolving the problem without probabilistic assumptions.