Is it possible to rewrite x(-1)^x-(-1)^x=y(-1)^y-(-1)^y In such a way i could reduce it to x=y ?
\[x,y \ge0\]
is that? \[x(-1)^x-(-1)^x=y(-1)^y-(-1)^y\] ?
I'd factor out \((-1)^x\) and \((-1)^y\) first
Because if you did that first, then you'd have \((-1)^x(x - 1) = (-1)^y(y - 1)\)
Afterwards, you can apply all the stuff @myininaya was talking about
After applying all those steps, you should end with the desired result.
thats where i started from
Can you show all the steps you have completed up to this point?
\[(-1)^x(x-1)=(-1)^y(y-1)\] that is
sure
Apparently only two of the four cases presented by @myininaya actually work.
Proving injection by contrapositive method \[f(x)=f(y)\] \[\frac{ ((-1)^x(2x-1)+1) }{ 4 }=\frac{ ((-1)^y(2y-1)+1) }{ 4 }\] . . . . \[(-1)^x(x-1)=(-1)(y-1)\] is as far as i've come. I don't know if there's another way to prove it with sets f: N -> Z
multiplied both sides with 4 subtracted 1 on both sides expaneded the brackets divided each expression with 2
ect...
etc*
How did you conclude that \( ((-1)^x(2x-1)+1)=((-1)^y(2y-1)+1)\) is equivalent to \((-1)^x(x-1)=(-1)(y-1)\) What did you do with the 2?
\[2x(-1)^x-(-1)^x=2y(-1)^y-(-1)^y\] \[<->\] \[\frac{ 2y(-1)^x-(-1)^x }{ 2 }=\frac{ 2y(-1)^y-(-1)^y }{ 2 }\]
ah i see hehe
\[x(-1)^x-(-1)^x=y(-1)^y-(-1)^y\] <-> \[(-1)^x(x-1)=(-1)^y(y-1)\]
can't see where i should go from here : / (-1)^y,x is annoying me
Based on what you posted originally, you could simplify it to \((-1)^x(2x - 1) = (-1)^y(2x - 1)\) I don't know how you got it to the other form you have. What you have is not an eqivalent form of the original equation.
Okay, i stil don't have an idea on what to do, from that expression. \[(-1)^x(2x-1)=(-1)^y(2y-1)\]
atm i can't see how i should simplify it, without disturbing either one of the sides
Well I deleted my cases because I didn't know if x and y were actually integers.
ye, the original function maps from N to Z
go with applying the cases like hero said 2 of the 4 will work those cases being both odd or both even
of course you won't have the function is invective if you assume one is even and one is odd because that would imply you don't have f(a)=f(b) implies a=b because there is no way an even can equal an odd
injective*
I see, i think i have to prove it in another way
but thank you very much :)!
Join our real-time social learning platform and learn together with your friends!