To prove strong goldbach conjecture one can use a lower bound of number of the representations of a number as the sum of two primes. If its greater than zero, than we have conjecture.
I wonder if there is an upper bound of this number of the representations for a number $x$?
Edit: I have edited the question to tell the question in my head properly. I apologize for the people who answered this question.