Ask your own question, for FREE!
Mathematics 30 Online
OpenStudy (anonymous):

i am baffled about how to do the following problem Sum to n terms the following series 2/(1.3.5) + 4/(3.5.7) + 6/(5.7.9) ...... I FOund this in a textbook in a paragraph about summing series by the method of differences.

OpenStudy (anonymous):

need you amistre

OpenStudy (amistre64):

the top is even sums right?

OpenStudy (amistre64):

the bottom is cycling thru odds

OpenStudy (amistre64):

....same problem btm? ;)

OpenStudy (anonymous):

yes

OpenStudy (amistre64):

k, give me a minute :)

OpenStudy (anonymous):

yes top and bottom are AP's

OpenStudy (anonymous):

k thanks!

OpenStudy (amistre64):

n=1; k=2 n=2; k=4 n=3; k=6 top is 2n

OpenStudy (amistre64):

n=1; a=1.b=3.c=5 n=2; a=3.b=5.c=7 n=3; a=5.b=7.c=9 if we solve fo "a" then ther rest are just add ons

OpenStudy (anonymous):

yes the general fortmula of the nth term = 2n- top part that is

OpenStudy (amistre64):

the bottom is 2n-1 for a

OpenStudy (amistre64):

2n --------------- 2n-1.2n+1.2n+3

OpenStudy (anonymous):

nth term for btm is(2n-1)(2n+1)(2n+3)

OpenStudy (amistre64):

at n=4 8 ------ 7.9.11

OpenStudy (amistre64):

times? if thats what the "." means then sure :)

OpenStudy (anonymous):

right - but the problem is we need to find the sum of n terms - this is where i got stuck

OpenStudy (anonymous):

yes '.' means multiply

OpenStudy (amistre64):

well, we have the equation; all we need to do is figure out the summation for it I spose

OpenStudy (amistre64):

2n 2n ------------------ = -------------- (2n-1)(2n+1)(2n+3) (4n^2-1)(2n+3)

OpenStudy (anonymous):

yeah right - I' must find out what the 'differences ' method is about. I think this stuff is really advanced.

OpenStudy (amistre64):

2n ------------------ 8n^3 +12n^2 -2n -6

OpenStudy (amistre64):

n ---------------- is what I get for a basis 4n^3 +6n^2 -n -3

OpenStudy (anonymous):

yes - thats right

OpenStudy (anonymous):

- but where do we go from here?

OpenStudy (amistre64):

we could split this by partial fraction decomposition if you think that would help to find seperate summations for each part...

OpenStudy (anonymous):

good idea

OpenStudy (amistre64):

which the first equation would be more helpful :)

OpenStudy (amistre64):

2n A B C ----------------- = ----- + ------ + ------ (2n-1)(2n+1)(2n+3) (2n-1) (2n+1) (2n+3)

OpenStudy (anonymous):

yep

OpenStudy (amistre64):

2n = A(2n+1)(2n-1) + B(2n-1)(2n+3) + C(2n-1)(2n+1)

OpenStudy (amistre64):

rewrite, thats miss typed lol 2n = A(2n+1)(2n+3) + B(2n-1)(2n+3) + C(2n-1)(2n+1)

OpenStudy (anonymous):

right 2nd time

OpenStudy (amistre64):

when n = 1/2; we get B0 + C0 + A(2)(4) = 1; A = 1/8

OpenStudy (amistre64):

when n = -1/2 we get A(0) + C(0) + B(-2)(2) = -1; B=1/4

OpenStudy (amistre64):

when n = -3/2; we get B0 + A(0) +C(-4)(-2) = -3; C = -3/8 right?

OpenStudy (amistre64):

do you see how I got those numbers? and if so did I do it right :)

OpenStudy (anonymous):

yes i understand your working - let me check them

OpenStudy (anonymous):

yes -that ok i think

OpenStudy (amistre64):

inthe meantime; we will also need to factor out the "2" from the denominators to get the "n" all by itself

OpenStudy (amistre64):

1 1 3 ------ - ------- - -------- 8(2n-1) 4(2n+1) 8(2n+3)

OpenStudy (amistre64):

1 1 3 --------- - --------- - -------- 16(n-1/2) 8(n+1/2) 16(n+3/2)

OpenStudy (amistre64):

Now to sum to the "nth" we can sum each seperately...\[[\frac{1}{16}\sum_{}\frac{1}{n-\frac{1}2}{}] -[\frac{1}{8}\sum_{}\frac{1}{(n+\frac{1}{2})}] -[\frac{1}{16}\sum_{}\frac{1}{n+\frac{3}{2}}]\]

OpenStudy (amistre64):

there is a process to get to the iterations; f(xi) delta(xi)

OpenStudy (amistre64):

(b-a)/n is the form im familiar with; where a is the leftmost in the interval and b is the rightmost. and n - the number of partitions....

OpenStudy (amistre64):

but thats starting to get into the cobwebs in my memory :)

OpenStudy (amistre64):

if n = the interval 1 to 10 and we partition it out every 1 unitl that would be 9; so I am thinking our delta(xi) = n-1

OpenStudy (amistre64):

any of this sound familiar or reasonable :)

OpenStudy (amistre64):

lets test my memory here: suppose we want to sum the numbers 1-9; that should equal 45 the equation would simply be "n" n(n-1) = n^2 -n our summation would amount to: n(n+1)(2n+1) n(n+1) ------------ - ------- if my head is right :) 6 2

OpenStudy (amistre64):

9(10)(19) 9(10) -------- - ----- = 1704 -45 = 1659; lol... i guess im rusty :) 6 2

OpenStudy (anonymous):

I got the same 3 sum expressions as you did amis but came to a dead end. i believe there must be a different approach to solve this one.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!