Equivalent Goldbach proof impossible question.

Click For Summary
SUMMARY

The discussion centers on the impossibility of proving that the number of unordered partitions of an even number 2n into 2 composites exceeds that of an odd number 2n+1 into 2 composites, specifically for n>1 and n not equal to a prime number. Participants highlight the challenge's similarity to the Goldbach Conjecture, emphasizing its unsolvable nature. The conversation suggests that this topic serves more as a humorous commentary on mathematical challenges rather than a serious inquiry.

PREREQUISITES
  • Understanding of number theory, particularly partitions of integers
  • Familiarity with the Goldbach Conjecture and its implications
  • Knowledge of composite numbers and their properties
  • Basic mathematical proof techniques and logic
NEXT STEPS
  • Research the Goldbach Conjecture and its historical context
  • Explore integer partition theory and its applications
  • Study the properties of composite numbers in number theory
  • Learn about unsolvable problems in mathematics and their significance
USEFUL FOR

Mathematicians, number theorists, and students interested in advanced mathematical concepts and unsolved problems in number theory.

e2theipi2026
Messages
8
Reaction score
1
Prove that the number of unordered partitions of an even number 2n into 2 composites is greater than the number of unordered partitions of an odd number 2n+1 into 2 composites for n>1 and n\ne p prime.
 
Last edited:
Mathematics news on Phys.org
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.
 
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.
 

Similar threads

Graduate Proving Goldbach's conjecture by induction (or why it doesn't seem to work)
  • · Replies 10 ·
Replies
10
Views
3K
Undergrad Questions regarding Kurepa's Conjecture
  • · Replies 1 ·
Replies
1
Views
2K
High School Doing proofs: Setting an expression as a variable
  • · Replies 3 ·
Replies
3
Views
1K
Every integer greater than 5 is the sum of three primes?
  • · Replies 4 ·
Replies
4
Views
3K
Prove that the Goldbach conjecture that every even integer....
  • · Replies 6 ·
Replies
6
Views
2K
MHB Solve Prove by Induction: 3^2n+1 + 2^n-1 Divisible by 7
  • · Replies 2 ·
Replies
2
Views
2K
Undergrad Is this a proof of the Collatz Conjecture?
  • · Replies 8 ·
Replies
8
Views
3K
MHB Questions about proof about primality testing
  • · Replies 16 ·
Replies
16
Views
3K
Graduate Prime Number Powers of Integers and Fermat's Last Theorem
  • · Replies 1 ·
Replies
1
Views
2K
MHB Is there an other way to show the proposition ?
  • · Replies 11 ·
Replies
11
Views
3K