Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Determine the infinite sum of b_k = c_k - c_(k-1)

  1. Oct 28, 2011 #1
    Suppose that [itex]b_k = c_k - c_{k-1}[/itex], where [itex]\langle c \rangle[/itex] is a sequence such that [itex]c_0=1[/itex] and [itex]\lim_{k → ∞} c_k = 0[/itex]. Use the definition of series to determine [itex]\sum^{∞}_{k=1} b_k.[/itex]

    I've done a little analysis, so I think that [itex]c_k[/itex] is decreasing, since the first term is greater than the limit of the sequence [itex]\Rightarrow b_k[/itex] [itex]\leq 0[/itex] and decreasing (I think).

    Also, by taking limit of both sides I obtain:
    [itex]\lim_{k → ∞} b_k = \lim_{k → ∞} c_k - c_{k-1} = 0[/itex].
    (I understand this does not conclude that the series converges)

    From the looks of the problem, it smells like Cauchy convergence criterion, but I'm not sure where to start with such an abstract description of the sequences.

    The hint says to compute the partial sums exactly, but since no explicit formula is given for [itex]\langle c \rangle[/itex], I'm not so sure how to go about this.

    Here is the definition we use for an infinite series:

    Let [itex]\langle a \rangle[/itex] be a sequence of real numbers. The formal expression [itex]\sum^{∞}_{k=1} a_k[/itex] is an infinite series. The number [itex]s_n = \sum^{n}_{k=1} a_k[/itex] is the nth partial sum of the series. The infinite series [itex]\sum^{∞}_{k=1} a_k[/itex] converges if [itex]\lim_{n → ∞} s_n[/itex] exists; otherwise the series diverges. When [itex]\sum^{∞}_{k=1} a_k[/itex] converges, we write [itex]L = \lim s_n=\sum^{∞}_{k=1} a_k[/itex] and say that the sum of the series equals [itex]L[/itex].

    Any help would be appreciated. Thanks so much!

    *EDIT* Let me know if I'm onto something here:
    Let [itex]s_n = \sum^{n}_{k=1} b_k[/itex] and [itex]S_n = \sum^{n}_{k=0} c_k = 1 + \sum^{n}_{k=1} c_k.[/itex]

    Then [itex]S_{n-1} = \sum^{n-1}_{k=0} c_{k-1} = 1 + \sum^{n-1}_{k=1} c_k.[/itex]

    Then [itex]s_n = S_n - S_{n-1} = 1 + \sum^{n}_{k=1} c_k - 1 - \sum^{n-1}_{k=1} c_k = c_n.[/itex]

    [itex]\sum^{∞}_{k=1} b_k = \lim_{n→∞} (S_n - S_{n-1}) = \lim_{n→∞} c_n = 0[/itex]
     
    Last edited: Oct 28, 2011
  2. jcsd
  3. Oct 28, 2011 #2

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    First of all, the [itex]c_n[/itex] does not need to be decreasing.

    Second, the hint is a good one:

    [tex]b_0=c_0[/tex]

    [tex]b_1+b_0=(c_1-c_0)+c_0=c_1[/tex]

    [tex]b_2+b_1+b_0=(c_2-c_1)+(c_1-c_0)+c_0=c_2[/tex]

    Generalize.

    EDIT: it seems you found it already...
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook