ns am struggling to recognize basics together it associated to developing a closed kind expression native a summation. I understand the score at hand, yet do not recognize the process for i beg your pardon to monitor in stimulate to accomplish the goal.

You are watching: How to find closed form of summation

Find a closed form for the amount k+2k+3k+...+K^2. Prove her claim

My very first approach to be to turn it right into a recurrence relation, which did not occupational cleanly. After that I would attempt to rotate from a recurrence relation into a closed form, but I am unsuccessful in obtaining there.

Does anyone know of a strong approach for addressing such problems? Or any type of simplistic tutorials that have the right to be provided? The material I uncover online does not help, and causes additional confusion.

Thanks

algorithm mathematics sum series recurrence
re-superstructure
improve this inquiry
monitor
edited Apr 26 "15 in ~ 20:39

request Apr 26 "15 at 17:57

BusturdustBusturdust
5
include a comment |

2
If you room interested in a general algorithm come compute sums favor these (and more facility ones) i can"t introduce the book A=B enough.

The authors have actually been so type to make the pdf openly available:

http://www.math.upenn.edu/~wilf/AeqB.html

Enjoy!

share
improve this price
follow
answered Apr 26 "15 at 19:02

soegaardsoegaard
include a comment |
2
No one provided the math approach, so ns am adding the mathematical approach to this AP problem.

Given series is 1k + 2k + 3k + .... + k.k(OR k^2)

Therefore, it method that there room altogether k terms with each other in the given series.

Next, as here all the consecutive terms are greater than the previous hatchet by a constant common difference,i.e., k.

So, this is an Arithmetic Progression.

Now, to calculate the basic summation, the formula is given by :-

S(n) = n/2a(1)+a(n) where,S(n) is the summation of series upto n terms

n is the variety of terms in the series, a(1) is the an initial term that the series, and a(n) is the last(n th) ax of the series.

Here,fitting the terms of the given series into the summation formula, we acquire :-

S(n) = k/21k + k.k = (k/2){k+k^2) = <(k^2)/2 + (k^3)/2>*.

re-superstructure
enhance this price
monitor
answered Apr 26 "15 at 20:02

2
include a comment |
1
Asad has defined a mathematical strategy in the comment to solving this.

If you room interested in a programming technique that functions for more facility expressions, then you deserve to use Sympy in Python.

For example:

import sympyx,k = sympy.symbols("x k")print sympy.sum(x*k,(x,1,k))prints:

k*(k/2 + k**2/2)
re-publishing
improve this prize
monitor
answered Apr 26 "15 in ~ 18:11

Peter de RivazPeter de Rivaz
1

thanks for contributing solution to stack Overflow!

But avoid

Asking because that help, clarification, or responding to various other answers.Making statements based on opinion; ago them increase with referrals or personal experience.

To discover more, check out our advice on writing an excellent answers.

See more: Watch Fairy Tail Dragon Cry Full Movie Putlockers, Fairy Tail: Dragon Cry (2017)

Draft saved

submit

### Post together a guest

surname
email Required, but never shown

### Post as a guest

surname
email

Required, yet never shown

## Not the price you're feather for? Browse various other questions tagged algorithm math sum collection recurrence or ask your very own question.

The Overflow Blog
Featured on Meta
related
0
Open-form and Closed kind
359
how to advice a mathematics expression given in cable form?
2
Summations and for loops
5
Substitution an approach for resolving recurrences
4
Dynamic programming recurrence relationship
0
iterative recurrence... Iteration technique
0
computer for the closed type of a recurrence relation: fractions
1
Towers the Hanoi Closed type Solution
1
find Closed form from Algorithm through multiple debates
warm Network questions much more hot inquiries

concern feed

ridge Overflow
commodities
company
ridge Exchange Network
site architecture / logo © 2021 ridge Exchange Inc; user contributions license is granted under cc by-sa. Rev2021.9.24.40305

Stack Overflow works best with JavaScript permitted

her privacy

By clicking “Accept every cookies”, friend agree ridge Exchange deserve to store cookie on your machine and disclose details in accordance v our Cookie Policy.