Is their a formula for finding finite sum of series with changing differences ?
\[Ex\] \[1+3+6+10+15+21.....\]
\[3+10+19+30+43...\]
there is two formula for finite series one for arithmetic and one for geometric
i know that but this series is different ,it shows changing difference pattern
yeah i mean there is a pattern but not same difference or same ratio but they have a pattern is that question you have or you just make that
is their formula for finding the nth term here if its a sequence
if yes then their should be formula for finding summation too
i don't think so we just have to figure out
for example this one 5,10,17,26,3 pattern for this one 5+5,10+7,17+11 mean we adding odd numbers every time
this is too complex for me
You can recognize that we are adding asequence which known to us 1,2,3,4,......n
yes
@geerky42
observe that \(1+3+6+10+15+21.....=1+(1+2)+((1+2)+3)+(((1+2)+3)+4)+((((1+2)+3)+4)+5).....\)
........ (forgot the continuation lol)
we can see that after taking care of parenthesis we infinite sum of 1+1+1+1.... 2+2+2+2+2.... 3+3+3+3+3 and so on
n sums of 1 is just n n sums of 2 is 2n n sums of 3 is 3n and so on then we would have n+2n+3n+4n+5n+6n........+n^2...... if we factor out n we would have n(1+2+3+4+5+6.....+n) for first n! and we already know the sum of \(\sum_{i=1}^{n}i=\frac{n(n+1)}{2}\) so the sum of that series for the first n numbers is \(n\sum_{i=1}^{n}i=\frac{n^2(n+1)}{2}\)
i guess this is how you would look at it! but not sure if i'm doing it the right way hehe
let's test this if it is true hehe
does not go right hehe
\(\large\ =\dfrac{n(n+1)(n+2)}{6}\)
where did you come with that that's for power series \(\sum_{k=1}^{n}k^2\)
this a fun series! 1+1+1+1+....+2+2+2+2+.....+3+3+3+3+..... what could be the sum of this! i was confident that i was going in the right path hehehe
\(\large\bf u~~~ can~~~ check~~~ it\) \(\large\sum _{i=1}^{\infty}\ n^2=\frac{n(n+1)(2n+1)}{6}\)
well it is blowing to infinity, but can we have a finite sum for a finite numbers!
yes
No that's a different case we have the other series 1+2+3+4... not \(1^2+2^2+3^2+4^2.....\)
but good to see u tried hard....
tag some other people hehe
no need
at last got it
hmmm, you sure! i think there are people who can help much better and this stuff are fun to think about
@ganeshie8 , @amistre64
i know they can solve in seconds
yes there is lol
well you question is kinda general!
1+3+6+10+15+21 find the first differences (akin to a first derivative if you will) 1+3+6+10+15+21 2 3 4 5 6 now the second differences are constant, a constant second derivative leads us to a quadratic right?
yes
riemann sums?
we can work this by taking the leading values (1,2,1) and applying them as: 1/0! + 2n/1! + 1[n(n-1)]/2! and simplify as needed, this is for n>=0
its akin to creating a taylor series
oh i see!
now the second differences are constant, a constant second derivative leads us to a quadratic right? ========= i didn't understand your line here?
\(\large\ n^2-n+1\)
a discrete formula has rates of change that are called differences a continuous rate of change are called derivatives
its for nth term
you might have to adjust it if your n starts at 1
if n starts at 1, and we are defined for n starts at 0, then let k=n-1, n=k+1
mathmath333 you should also think about triangular numbers they did not give you just some random quadratic sequence, the sequence is a nice well known triangular numbers
and how did you decide that is quadratic!
@ganeshie8 i absolutely now this
second sequence looks bit off though
eh! i'm lost now! hehe
but its right
f = x^2 f' = 2x f'' =2 notice that a quadratic has a constant 2nd derivative
yes! i see that
a constant 2nd differences will be a discrete quadratic
@ganeshie8 if i know the formula for nth term for 2nd series then can i find the summaation of the second series?
we can work a long way: a0 a1 a2 a3 a4 b0 b1 b2 b3 c c c bn = b0 + nc a0 a1 a2 a3 a4 b0+0c b0+1c b0+2c b0+3c a1 = a0 + b0 + 0c a2 = a0 + b0 + 0c + b0+1c = a0 + 2b0 + c(0+1) a3 = a0 + 3b0 + c(0+1+2) a4 = a0 + 4b0 + c(0+1+2+3) an = a0 + nb0 + c(1+2+3+n-1)
forgot a .... inthe c parts lol
yes you can find partial sum for any sequence : \[\large \sum \limits_{n=1}^{k} a_n\] whats your formula for nth term ?
hmm now it looks way better! thanks @amistre64
if you work enough of them you see a correlation to differential equations
the difference tree also creates a kind of pascal triangle
thats like finding 3 equations and solving the unknowns : 1 3 6 10 let the required nth term formula be "ax^2+bx+c" you can get 3 equations by using the first 3 terms : a + b + c = 1 4a + 2b + c = 3 9a + 3b + c = 6 we can solve these, but yes you won't learn anything about the pattern with this method
\(\large\ nth~~term=n^2+4n-2\)
oh right! that looks like a pascal triangle!
i had less practice on differential equations! hehehe
partial sum of first \(k \) terms \[\large \sum \limits_{n=1}^{k} (n^2 + 4n-2) = \sum \limits_{n=1}^{k}n^2 + 4\sum \limits_{n=1}^{k} n -2\sum \limits_{n=1}^{k} 1 \]
you must be having readymade formulas for sum of squares and sum of first n terms already ?
yes i know few
its time to use them to your advantage
if not, you can always use what we did at the start to develop them :)
\[\large \begin{align} \sum \limits_{n=1}^{k} (n^2 + 4n-2) &= \sum \limits_{n=1}^{k}n^2 + 4\sum \limits_{n=1}^{k} n -2\sum \limits_{n=1}^{k} 1 \\~\\ &= ? + ? + ? \end{align} \]
see if you can simplify and get a nice looking expression for the sum in terms of "k" alone
eh he already mentioned the two sum N^2 and N the sums of 1's are easy
@mathmath333, just check you replies above^_^
lol i will
here in one place : \(\large \sum \limits_{n=1}^{k}n^2 = \dfrac{k(k+1)(2k+1)}{6} \) \(\large \sum \limits_{n=1}^{k}n = \dfrac{k(k+1)}{2} \) \(\large \sum \limits_{n=1}^{k}1 = k \)
thanks everyone
oh its wrong hehe
whats wrong ?
nothing , i posted a wrong equation
\(\large\bf\ =\dfrac{k(2k^2+15k+1)}{6}\)
at last........sigh
very happy
Join our real-time social learning platform and learn together with your friends!