Equivalent Goldbach proof impossible question.

In summary, the conversation discusses the impossibility of proving the Goldbach Conjecture and whether the original post is asking for help or posting a solved challenge.
  • #1
e2theipi2026
9
1
Prove that the number of unordered partitions of an even number [tex]2n[/tex] into [tex]2[/tex] composites is greater than the number of unordered partitions of an odd number [tex]2n+1[/tex] into 2 composites for [tex]n>1[/tex] and [tex]n\ne p[/tex] prime.
 
Last edited:
Mathematics news on Phys.org
  • #2
Re: Equivalent Goldbach proof impossible queston.

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.
 
  • #3
Re: Equivalent Goldbach proof impossible queston.

MarkFL said:
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.
 

1. Is there a proof for the "Equivalent Goldbach proof impossible" question?

No, there is currently no proof for this question. It remains an unsolved problem in mathematics.

2. What is the "Equivalent Goldbach proof impossible" question?

The "Equivalent Goldbach proof impossible" question is a conjecture in number theory that states there is no proof for the Goldbach Conjecture, which states that every even number greater than 2 can be expressed as the sum of two prime numbers.

3. Who first proposed the "Equivalent Goldbach proof impossible" question?

The "Equivalent Goldbach proof impossible" question was first proposed by Hungarian mathematician Paul Erdős in 1938.

4. Why is it important to find a proof for the "Equivalent Goldbach proof impossible" question?

Finding a proof for this question would not only settle a long-standing problem in mathematics, but it would also have implications for other unsolved problems in number theory and potentially lead to new mathematical insights.

5. How many mathematicians have attempted to solve the "Equivalent Goldbach proof impossible" question?

It is difficult to determine an exact number, but many prominent mathematicians have attempted to solve this question, including Hardy, Littlewood, and Vinogradov.

Similar threads

Every integer greater than 5 is the sum of three primes?
    • Precalculus Mathematics Homework Help
Replies
4
Views
2K
I Is this a proof of the Collatz Conjecture?
    • General Math
Replies
8
Views
2K
Prove that the Goldbach conjecture that every even integer....
    • Precalculus Mathematics Homework Help
Replies
6
Views
1K
B Doing proofs: Setting an expression as a variable
    • General Math
Replies
3
Views
821
A Prime Number Powers of Integers and Fermat's Last Theorem
    • General Math
Replies
1
Views
774
MHB Solve Prove by Induction: 3^2n+1 + 2^n-1 Divisible by 7
    • General Math
Replies
2
Views
1K
I Simple, almost "intuitive" conjecture, hard or impossible to solve?
    • General Math
Replies
5
Views
1K
Determine (with proof) the set of all prime numbers
    • Precalculus Mathematics Homework Help
Replies
3
Views
947
I Optimization problem with multiple outputs: impossible?
    • General Math
Replies
6
Views
1K
B Calculating the coprime probability of two integers in a different way
    • General Math
Replies
13
Views
1K

Hot Threads

Recent Insights

Back
Top