See comments, please halp. :C
Um, I believe the question messed up, retype it again.
Could anyone give a clue on how to rewrite \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\] given that you know \[\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}\]
I'm thinking of changing the "interval" of the left term sum so that you can utilize and rewrite as the right term in the second statement.
You're still left with \[\sum_{k=2m}^{2(m+2)} \frac{(-1)^{k+1}}{k}\] though and I'm not sure where to go from here.
O_o
Is it possible to perhaps "bake" this together with \[\sum_{k=m+1}^{2m}\frac{1}{k}\], if so how? Not sure if this is a step in the right direction.
are you solving for \(m\)?
It's not a solve I'm looking for, I'm trying to prove by induction that the statement is true.
It shouldn't be that hard tbh. :(
oh what is the original statement?
Maybe my initial induction proposition is clumsily chosen(?) -- it's the second one in the first comment.
oh i see, you are going from \(m\) to \(m+1\) i get it, but somehow this looks kind of unlikely
Prove that \[\sum_{k=1}^{2n}\frac{(-1)^{k+1}}{k}=\sum_{k=n+1}^{2n}\frac{1}{k}, \forall n \in\]
wow there is a fact i did not know
Belongs to natural that is.
It's quite a basic proof also which bothers the hell out of me, been sitting with this for some time. >_<
let me right it on paper and see if i can do it usually summations are easy because the previous case stares you right in the face
That's what I think is happening, which is even more cruel, haha.
Maybe it's easier to try to rewrite the right term instead? (When you're trying to prove for n=m+1)
just a sec, it think it is just algebra
you got it?
nope
I was thinking that might be a way to go about solving it, but it didn't feel like it.
ok i think we can do it easily, just give me a second in fact, i don't think it is algebra at all
we know this \[\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}\] we want this \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\]
I'm quite certain it's about utilizing the "range" of the sum (not sure if you know what I mean by range, not native eng. )
the left hand side can be rewritten as \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\]
Oh, that's right. Still too rusty with sums. :/
if my algebra is correct, those are just the last two terms of the sum
so by induction \[\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\]
Thing is, how do you connect/rewrite that into a single sum with initial element k=m+2 and last element 2m+2?
I don't see it. :(
give me a sec all we have to do is write the difference between \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\] and \[\sum_{k=m+1}^{2m}\frac{1}{k}\]
to get from the bottom one to the top one, you have two extra terms at the end, minus the first term \[\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\]
now if by some miracle \[\frac{1}{2m+1}-\frac{1}{2m+2}=\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\] then we would have it
Don't you have to "add" that last term seeing as how the above sum doesn't "include" it? Or am I thinking completely wrong
you want to get from\[\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\] to \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\]
and \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\]
lets see if the algebra works
Hey, is there any way I can click, like... a "leave" button because I'm getting a lot of unwanted notifications..
yes, it works!~!!!
I don't see how you derive to that last statement.
this one?\[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\]
Yes! :C
the only difference between the first sum and the second sum is: the first one goes up to \(2m+2\) instead of just \(2m\) so it inludes \(\frac{1}{2m+1}\) and \(\frac{1}{2m+2}\) whereas the second sum does not
also the first one starts at \(m+2\) whereas the second one starts at \(m+1\) so the first one is missing the \(\frac{1}{m+1}\) term
that is why \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\] it has nothing to do with the induction, it is just a fact
Ooh, I see! But how did you arrive to \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\] from the initial left hand side? (also; I don't know whalexnuker)
ok lets start at the beginning so we can clean this up okay?
Yes!
we know \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\] just a fact, tack on the last two terms
it is taking me a while to write, give me a sec
Yes, don't worry; your help is extremely appreciated. Thanks for taking the time. :)
by induction, this you can replace \[\sum_{k=1}^{2m}\frac{(-1)^{k+1}}{k}\] by \[\sum_{k=m+1}^{2m}\frac{1}{k}\] giving \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\]
by algebra \[\frac{1}{2m+1}-\frac{1}{2m+2}=\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\]
this you can check by doing the computation and seeing you get the same answer
._. Thanks for ignoring me.
There is no way that I'm aware of Whalexnuker.
and then by writing as a sum, we see \[\sum_{k=1}^{2(m+1)}\frac{(-1)^{k+1}}{k}=\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\] \[\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}\] \[=\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\]which is what you wanted
that is the proof, but maybe not the understanding of the steps
The only step that's troubling me now is the one where you use algebra to rewrite 1/(2m+1)-1/(2m+2) to the expression in the middle. :/ How do you realize that you're supposed to do that and how do you actually do it?
ok i will say it in english, bacause it will take me forever two write it
i realized it because it had to be true in order for this to work
Haha, sure.
in other words, i compared the sum \[\sum_{k=m+2}^{2(m+1)}\frac{1}{k}\]which is what you wanted to get, with the sum \[\sum_{k=m+1}^{2m}\frac{1}{k}\] which is what you had
i wrote what was in the first, that was not in the second
as i said, the first has the extra two terms \(\frac{1}{2m+1}\) and \(\frac{1}{2m+2}\) and was missing the first term \(\frac{1}{m+1}\)
then in order for this to work, it had to be true that \[\frac{1}{2m+1}+\frac{1}{2m+2}-\frac{1}{m+1}=\frac{1}{2m+1}-\frac{1}{2m+2}\]
because by induction, you had \[\sum_{k=m+1}^{2m}\frac{1}{k}+\frac{1}{2m+1}-\frac{1}{2m+2}\]
Could you reason like this: because the sum does not involve a negative end term because of 1/k that it "has" to be positive and for you to be able to "bake" it in you also have to take in account the term that the result that you're trying to get to "misses" precisely 1/(m+1)?
no
well, pellet. Haha
oh maybe i did not think about negative numbers, but no matter because the algebra works
any way it was a matter of looking at what you needed to get what you wanted if it was going to be true, it had to work
I'm just thinking about "how to think" in order for it to be viable to arrive at the correct conclusion, if you follow.
yes but inductive proofs are usually more mechanical than intuitive they do not really give a reason, they just prove it is true
it is more or less obvious for example that \[\sum_{k=1}^n=\frac{n(n+1)}{2}\] but the easy inductive proof does not explain how to get the formula at all, it just shows it is true for all \(n\)
gotta run, good luck
To arrive at a formula is more or less not supposed to be required, I'll just hope for the best in the future. Thanks so much for your time, and have a nice day/week/future. Adieu! =)
Join our real-time social learning platform and learn together with your friends!