Abstract
The Strong Goldbach's conjecture states that every even integer greater than 2 can be expressed as sum of two prime numbers. In the year 1742, German mathematician Christian Goldbach first proposed this famous conjecture in a letter to Leonard Euler. Despite large computational efforts and empirical evidence, there is no widely accepted proof till date and remains unproven. In this paper, we have shown how a given even number greater than 2 can be split and partitioned using a new formulation based on the Bertrand's postulate and there will be at least a pair of primes such that P1 + P2 = 2n. Also, we have introduced a novel approach to define a Lower, Central and Upper bounds on the sum of two odd primes in the intervals [2, n] and [n, 2n] which helps to understand the strong Goldbach's conjecture.