# When does Goldbach get away from non research levels? [closed]

This polynomial being every natural number greater than 3 is consistent with Goldbach's conjecture, because if both halves are positive, this is half a sum of two primes.I'm mostly trying to show

Would this monstrosity of an equivalent to Goldbach's conjecture, be offtopic on math.SE?

Mostly tempted to use this to annoy people who think what they have is new without doing research. Especially on Goldbach questions. But I'm trying to be on topic for the main site.

## closed as off-topic by Jyrki Lahtonen, José Carlos Santos, Surb, JonMark Perry, YuiTo ChengJun 17 at 13:42

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question does not appear to be about Mathematics Stack Exchange or the software that powers the Stack Exchange network within the scope defined in the help center." – Jyrki Lahtonen, José Carlos Santos, JonMark Perry, YuiTo Cheng
If this question can be reworded to fit the rules in the help center, please edit the question.

• That's 26 Latin Alphabet, 24 Greek Alphabet, and 2 Hebrew Alphabet letters for those that don't know. – Roddy MacPhee Jun 16 at 22:21
• I'm voting to close this question as off-topic because it doesn't seem to be a really meta question but rather an excuse to post on meta in order to get more visibility. – Surb Jun 17 at 8:18
• Why is there a $\beth$ in there? – Asaf Karagila Jun 17 at 10:50
• because I needed more than the latin and greek lower case could provide. – Roddy MacPhee Jun 17 at 11:28
• @surb it specifically asks if this is offtopic on the main site. – Roddy MacPhee Jun 17 at 11:31
• plus if Inwanted more attention I have anorher users email to send to, and I surely would not delete downvoted questions. – Roddy MacPhee Jun 17 at 11:41

This was originally going to be a comment, but I realized it's more of an answer.

Perhaps the first question you might want to ask should be: Is this equivalent to Goldbach's conjecture? If you explain why you think it is, that should be sufficient context. As a side note, if I'm reading the link correctly, I'm pretty sure it's not equivalent. Note that the poly at the link doesn't necessarily produce all primes, and only its positive values are prime. Its negative values are not necessarily prime. (Also, it has (lots of) negative values, which would also be a problem, no?)

Lastly, the question you've asked about here would be on topic, given adequate context, but I'm not really sure that would make it either a good question or cause you to get an answer that you'd like. What exactly would you be looking for in a solution to your question? A proof of the Goldbach conjecture? Forgive me if I think that seems unlikely to occur.

Also to be clear, I don't think you've provided adequate context here. Your question as written here is:

This is equivalent to the Goldbach conjecture. Can someone show me how to prove it?

Context you might want to add is

• A proof of equivalence to the Goldbach conjecture, or
• Alternatively a reference that actually shows that it's equivalent.
• If you want to prove it by induction, at least prove the base case, and show us where you're getting stuck with the inductive step.

The moral of the story here is that when asking a question, you should generally explain two things

1. Why you want to solve it, and
2. where you're getting stuck.

I see neither of those at present.