MHB Equivalent Goldbach proof impossible question.

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.
 

Thread 'What Exactly is Dirac’s Delta Function? - Insight'

Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
View full post »

Thread 'Fermat's Last Theorem'

Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
View full post »

Thread 'Useless continued fraction for 1'

I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
View full post »

Similar threads

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

Hot Threads

Recent Insights

Back
Top