# Thread: Equivalent Goldbach proof impossible question.

1. Prove that the number of unordered partitions of an even number $\displaystyle 2n$ into $\displaystyle 2$ composites is greater than the number of unordered partitions of an odd number $\displaystyle 2n+1$ into 2 composites for $\displaystyle n>1$ and $\displaystyle n\ne p$ prime.

2. Are you:

• Posting this as a challenge (where you have solved it)? If so, I will move this thread to our challenges forum.
• Asking for help with the question? If so, please post what you have done and where you are stuck.

Originally Posted by MarkFL
Are you:

• Posting this as a challenge (where you have solved it)? If so, I will move this thread to our challenges forum.
• Asking for help with the question? If so, please post what you have done and where you are stuck.
No, this is equivalent to proving Goldbach Conjecture, no one is going to solve it. Just a joke. You can delete if you wish.