Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

If I know that $a_{n}=f(n)$, is there any reliable means of finding a non-recursive equation for the partial sum from 1 to some n?

share|improve this question
3  
In general, no. Do you have a specific series in mind? – Aryabhata Feb 29 '12 at 23:37
The answer is no since your function is $C^\infty$ howerever if you function is a Polinomial the series will be divergent. – checkmath Feb 29 '12 at 23:39
There is no general method. There are methods for certain restriced classes of functions $f(n)$, such as polynomials. – André Nicolas Mar 1 '12 at 0:03

1 Answer

up vote 1 down vote

See e.g. "Gosper's algorithm" in the case of hypergeometric terms for which the sum can be expressed as $S(n) - S(0)$ where $S(n)$ is a hypergeometric term.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.