Using Telescoping Property for Summing ∑(2k-1)

  • Context: Undergrad 
  • Thread starter Thread starter unintuit
  • Start date Start date
  • Tags Tags
    Property
Click For Summary

Discussion Overview

The discussion revolves around the use of the telescoping property in summing the series ∑(2k-1), which represents the sum of the first n odd numbers. Participants explore the validity of this method and its implications for finding finite sums, as well as the limits of the expressions involved.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant asserts that using the telescoping property leads to the conclusion that ∑(2k-1)=n², questioning whether this is a proper application of the method.
  • Another participant agrees with the initial claim and discusses the concept of "anti-differencing" as analogous to antidifferentiation, suggesting that there are established methods for simplifying finite sums.
  • A participant expresses curiosity about determining the limit of the expression Σ[k²-(k-1)²]=Σ(2k-1) and whether it approaches 0 or 1, presenting a reasoning process involving summation over n.
  • Another participant seeks clarification on which limit is being referred to, asking if it pertains to k approaching infinity, zero, or another value.
  • A later reply indicates that the participant resolved their confusion regarding the limits by reconsidering their initial assumptions about the values of k.

Areas of Agreement / Disagreement

Participants generally agree on the validity of using the telescoping property for summing the series, but there is uncertainty regarding the limits of the expressions and the interpretation of the problem. The discussion remains unresolved on the specifics of these limits.

Contextual Notes

Participants express varying assumptions about the limits and the nature of the series, indicating potential dependencies on definitions and interpretations that are not fully clarified.

unintuit
Messages
10
Reaction score
0
1+3+5+...+(2n-1)=∑(2k-1)

but (2k-1)=k2-(k-1)2
summing we use the telescoping property and deduce that ∑(2k-1)=n2-02=n2

This seems accurate to me. Now my question is this a proper use of the telescoping property. In the least it reveals the proper answer, which can then be proved by induction.
 
Physics news on Phys.org
You example illustrates the use of a telescoping sum to reach a correct conclusion about finite sums. This is a reliable method of reasoning about finite sums. Is that what you mean by the words "accurate" and "proper" ?

The problem of finding simple expressions for finite sums can be regarded as the problem of "anti-differencing", which has an analogy to antidifferentiation in calculus. You can find material online about doing anti-differencing and there are rules for it that are analogous to those used for antidifferentiation. For example, there is Summation By Parts ( http://en.wikipedia.org/wiki/Summation_by_parts ) which is analgous to Integration By Parts.
 
Yes to your first question. I was also interested in how one would determine the limit of the expression Σ[k2-(k-1)2]=Σ(2k-1). How would one know if it were to approach 0 vs. 1.
I assumed that it went to zero because
i. (k+1)2=k2+2k+1=(k+1)2-k2=2k+1 then summing over n we have [(n+1)2-(1+n)]/2=∑k. subtracting 1 from the terms in i. gave [k2-(k-1)2]→(n+1-1)2-(1-1)2=n2. I did not know how to determine the limit which is why I was curious if this is a good way to figure out the sum vs. some unknown way. If there is some other way, what would it be?
 
unintuit said:
Yes to your first question. I was also interested in how one would determine the limit of the expression Σ[k2-(k-1)2]=Σ(2k-1).

What limit are you talking about? The limit of the expression as k approaches infinity? - or the limit of the expression as k approaches zero? - or as k approaches some other number?
 
Nevermind, I figured out my mistake. I was thinking about it in the wrong way. It was starting with k=1 and ki∈ℕ with k1<k2.
Thank you for your help.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
8
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K