Re: Help with recursion

In article <1138694385.335293.29860@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
robert.w.adams@xxxxxxxxxxx <robert.w.adams@xxxxxxxxxxx> wrote:
>OK, if I do that then I get
>
>sum(2 to n) x_sub_n = sum(2 to n) x_sub(n-1) + sum(2 to n) K/log(n)
>
>and if I subtract sum(2 to n) x_sub(n-1) from both sides;
>
>x_sub_n = sum(2 to n) K/log(n)
>
>Is there a closed-form solution for sum(2 to n) K/log(n) ?

Don't use the same letter for the dummy variable as for an endpoint
of the summation. You mean sum_{j=2}^n K/log(j). No, there isn't
a closed-form solution AFAIK.

Robert Israel israel@xxxxxxxxxxx
Department of Mathematics http://www.math.ubc.ca/~israel
University of British Columbia Vancouver, BC, Canada

.

Relevant Pages

  • Re: Relating two sums
    ... one-to-one on the positive reals, assuming some k_i is nonzero), ... although there will certainly be no closed-form solution. ... But knowing ... Prev by Date: ...
    (sci.math)
  • Re: Does this nonlinear feature in positive definite matrices have a name?
    ... very simple form I am quering around for a closed-form solution (if one ... Trond ... Prev by Date: ...
    (sci.math.symbolic)
  • Re: Help with recursion
    ... and if I subtract sumx_subfrom both sides; ... Is there a closed-form solution for sumK/log? ... Bob Adams ... Prev by Date: ...
    (sci.math)
  • Find Root
    ... I have a question regarding how to find a root for ... this is a quadratic equation and a closed-form solution can be ... Prev by Date: ...
    (sci.math)