# An observation on Goldbach Conjecture [closed]

Let $\beta(n)$ represent the number of Goldbach prime pairs that each add up to an even integer $n$.

Observation: If $p$ is a prime, for $n \ge 152$, (ignoring $n$ = powers of $2$)

$$\beta(n) \le \beta(p*n) < p*\beta(n)$$

For powers of $2$, the above inequality is true for $n \ge 128$.

Since any number $m$ can be obtained by multiplying primes, replacing $p$ with $m$ in the above inequality would work as well.

Implication: If we start with some $n = 2p$, we know that $\beta(2p) \ge 1$. And so proving the above inequality would prove GC.

Question: If this inequality is indeed true, how would one go about proving it? What approaches would you take? Any hints? Thanks

## closed as unclear what you're asking by Eric Tressler, Namaste, Daniel W. Farlow, JonMark Perry, SmylicMay 24 '17 at 6:18

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• Upto which number did you check the double-inequality ? – Peter May 23 '17 at 22:21
• I have access to one million primes.. So whatever the even number is above the last one. – sku May 23 '17 at 22:23
• the left inequality is enough to prove GC if it holds true for all primes(integers as well). – Ahmad May 23 '17 at 22:24
• I am curious. Why are people trying to close this question. Can someone please explain? Thanks – sku May 24 '17 at 3:58
• I wrote my question at the end of this post. Let me know if that is still unclear. If not, could you remove the hold please? Thanks – sku May 24 '17 at 20:41

Then $\beta(68) = 2$ and $\beta(34) = 4$ and $68 = 2 * 34$, with 2 being prime...
I am definitely not sure that your inequality is correct. We also have $\beta(152)=4$ and $\beta(76)=5$.