Interchanging mathematical operations proof

homegrown898
Messages
16
Reaction score
0
I'm working on the following two proofs:

1.) (x+y)2n+1 = x2n+1 + y2n+1 if and only if x=0, y=0 or y=-x

and

2.) (x+y)2n = x2n + y2n if and only if x=0 or y=0

I've tried using induction and get stuck at a certain point. I've also tried playing around with summations since there is a binomial expansion in there. I haven't had any luck. Earlier today however I found that this equality is true:

x2n+1 + y2n+1 = (x+y)(x2n - x2n-1y + x2n-2y2 - ... - xy2n-1 + y2n)

I haven't played around with this yes, but I think setting this equal to (1) might help prove this.

I'm just wondering if anyone has any ideas on this.
 
Last edited:
Mathematics news on Phys.org
hi homegrown898! :smile:

have you tried differentiating?
 
I haven't tried that no and I'm not exactly sure what you mean
 
if eg (1 + x)6 - 1 - x6 = 0 at x = 0 and at x = something else,

then its derivative must be zero somewhere in between :wink:
 
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...
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...
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.

Similar threads

Back
Top