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

differential equations homework help

OpenStudy (anonymous):

Find an interval around x = 0 for which the initial value problem: \((x-2)y''+3y=x\), y(0) = 0, y'(0) = 1 has a unique solution.

OpenStudy (anonymous):

we can please discuss this. i dont want answer maybe guidaeance

OpenStudy (amistre64):

well, in order for this to have a unique solution, i recall that the leading term would have to NOT be zero; so we have a split in the field at x=2 i see no other foibles at the moment

OpenStudy (anonymous):

so for guess of *y* can i use \[y=\sum_{n=0}^{\infty} C_n(x-2)^n\]

OpenStudy (amistre64):

im not too sure at the moment how the (x-2) would differ in regards to just (x)

OpenStudy (amistre64):

but yes, you could try that for a guess

OpenStudy (anonymous):

oh. i know u can make 3 guess i think \[C_nx^n\] and \[C_n(x-x_0)^n\] and \[C_nx^{r+n}\] how do u tell when u use number 2 or 3?

OpenStudy (amistre64):

my thought is, since x=0 does not create a "bad" setup; that this would be similar to finding the radius or interval of convergence of a power series

OpenStudy (anonymous):

oic let me try first can u please check my work if u have time sometime today? i have exam tomorrow so i want to really be good at understand. and thank u for answer me :)

OpenStudy (amistre64):

ill be able to check the math, but im not sure if i would be able to check the concepts :)

OpenStudy (anonymous):

yes just math hehe series r hard

OpenStudy (anonymous):

also one more do i leave the x there? or do change it? (x-2)y''+3y =-- > x <--

OpenStudy (amistre64):

\[(x-2)\sum_2a_nn(n-1)x^{n-2}+\sum_03a_nx^n=x\] \[(x-2)\sum_2a_nn(n-1)x^{n-2}+\sum_23a_{n-2}x^{n-2}=x\] \[(x-2)\sum_2[a_nn(n-1)+3a_{n-2}]x^{n-2}=x\] \[\sum_2[-2a_nn(n-1)-6a_{n-2}]x^{n-2}\\~~~~~~~+\sum_2[a_nn(n-1)+3a_{n-2}]x^{n-1}=x\] \[\sum_2[-2a_nn(n-1)-6a_{n-2}]x^{n-2}\\~~~~~~~+\sum_3[a_nn(n-2)+3a_{n-3}]x^{n-2}=x\] \[[-2a_22(2-1)-6a_{2-2}]x^{2-2}\\~~~~~~~+\sum_3[-2a_nn(n-1)-6a_{n-2}]x^{n-2}\\~~~~~~~~~~~~~~~+\sum_3[a_nn(n-2)+3a_{n-3}]x^{n-2}=x\] \[-4a_2-6a_{0}\\~~~~~~+\sum_3[-2a_nn(n-1)-6a_{n-2}+a_nn(n-2)+3a_{n-3}]x^{n-2}=x\] \[\sum_3[-2a_nn(n-1)-6a_{n-2}+a_nn(n-2)+3a_{n-3}]x^{n-2}=(4a_2+6a_{0})+x\]

OpenStudy (amistre64):

might have gone the wrong way on my index change ....

OpenStudy (anonymous):

so i get right now \[y'' = \sum_{n=0}^{\infty}n(n-1)C_nx^{n-2}\] and use \[y= \sum_{n=0}^{\infty}C_nx^n\] after i get \[(x-2)\sum_{n=0}^{\infty}n(n-1)C_nx^{n-2}-3\sum_{n=0}^{\infty}C_nx^n\] so i changes it to \[\sum_{n=0}^{\infty}n(n-1)C_nx^{n-1}-2\sum_{n=0}^{\infty}n(n-1)C_nx^{n-2}+3\sum_{n=0}^{\infty}c_nx^n\]

OpenStudy (anonymous):

now i will do index change but wat do i change? or how do i do so? because i have n-1 and n-2? do i change all to n only?

OpenStudy (anonymous):

bring all down to zero?

OpenStudy (amistre64):

to change in index:\[\Large \sum_{n=(3)}x^{(n-k)}=\sum_{n=(3+x)}x^{(n-k-x)}\]

OpenStudy (anonymous):

ok so \[\sum_{n=1}^{\infty}n(n+1)c_{n+1}x^n-2\sum_{n=2}^{\infty}(n+2)(n+1)c_{n+2}x^n+3\sum_{n=0}^{\infty}c_nx^n\] now i can factor 1 and 2 terms to bring back to zero?

OpenStudy (amistre64):

when we have the x^(n) all lined up, we can factor yes; but we first need to move the indexes to match; so i believe its best to start poping out the ns until n=3 on all of them

OpenStudy (amistre64):

well, n=2 in this case

OpenStudy (anonymous):

why n=2? if i may ask.

OpenStudy (anonymous):

that is where i get confused

OpenStudy (amistre64):

\[(x-2)\sum_{2}n(n-1)C_n(x-2)^{n-2}+3\sum_{n=0}C_n(x-2)^n=x\] \[\sum_{2}n(n-1)C_n(x-2)^{n-1}+3\sum_{n=0}C_n(x-2)^n=x\] \[\sum_{2}n(n-1)C_n(x-2)^{n-1}+3\sum_{n=0+1}C_{n-1}(x-2)^{n-1}=x\] \[\sum_{2}[n(n-1)C_n+2C_{n-1}]~(x-2)^{n-1}+3C_{0}=x\]

OpenStudy (amistre64):

well, in your setup up there, your highest index is n=2; so we would want to pull out the n=1, and n=2 from the other summations to line everything up

OpenStudy (amistre64):

in other words; we know that from n=2 and above, we have a factorable form of the summation; by pulling out the lesser ns to line up our factors, we create seperate terms that can then be able to define a polynomial on the right hand side of it all to compare with

OpenStudy (anonymous):

oh did u use \[\sum_{n=0}^{\infty} c_n(x-2)^n\] for u guess?

OpenStudy (amistre64):

i gave it a shot, i figured there was no harm yet :)

OpenStudy (anonymous):

did it make easier? hehe

OpenStudy (amistre64):

as long as the interval of convergence of the power series include x=0, we cshould be fine

OpenStudy (amistre64):

\[\sum_{2}[n(n-1)C_n+2C_{n-1}]~(x-2)^{n-1}+3C_{0}=x\] \[(2C_2+2C_{1})~(x-2)+\sum_{3}[n(n-1)C_n+2C_{n-1}]~(x-2)^{n-1}+3C_{0}=x\] \[2xC_2+2xC_{1}-4C_2-4C_{1}+\sum_{3}[n(n-1)C_n+2C_{n-1}]~(x-2)^{n-1}+3C_{0}=x\]

OpenStudy (amistre64):

notice that we have all we need to define a recurrsion now

OpenStudy (amistre64):

\[(3C_0-4C_1-4C_2)+(2C_1+2C_2)x=0+1x\] and the summation fills with zeros

OpenStudy (anonymous):

OHHHHH!!!! I see what you did!! beautiful!!

OpenStudy (anonymous):

where does the \[2C_2+2C_1\] come from?

OpenStudy (amistre64):

since latex and mathing dont mix that well, you might want to rework it all out by the steps to make sure the end is correct

OpenStudy (amistre64):

that comes from pulling out the first few terms of the lower summations as you get the indexes to line up

OpenStudy (anonymous):

yes. i am going to try ur method. this worksheet i have is old exam practice question teacher gave no end answers to check.

OpenStudy (amistre64):

\[\sum_0a_nx^n+\sum_1b_nx^n+\sum_2c_nx^n\] \[a_0x^0+b_1x^1+\sum_1a_nx^n+\sum_2b_nx^n+\sum_2c_nx^n\] \[a_0x^0+b_1x^1+a_1x^1+\sum_2a_nx^n+\sum_2b_nx^n+\sum_2c_nx^n\] \[a_0x^0+b_1x^1+a_1x^1+\sum_2(a_n+b_n+c_n)x^n\]

OpenStudy (amistre64):

in your setup, we end up with a polynomial on the left and right that have to equal, so we compare their coeffs

OpenStudy (anonymous):

dont u need to factor 2 for \[a_n\] ? because it begins at zero? i think that is what someone told me

OpenStudy (anonymous):

and to match index at 2, u need 2 terms?

OpenStudy (amistre64):

correct, tho im not sure how your using the phrase "factor". But yes, you have to remove the first few tems of the series to line up the indexes in order to merge them all into one cohesive summation

OpenStudy (amistre64):

\[\large \sum_1^ka_n=a_1+a_2+a_3+...+a_k\]\[a_1+a_2+(a_3+...+a_k)=a_1+a_2+\sum_{3}^{k}a_n\]

OpenStudy (anonymous):

so does not matter how many terms? since indez for first begins at zero dont i need 2 terms to pull out?

OpenStudy (amistre64):

you want to match your highest index; so the number of terms you pull out will depend on where your other indexes actually start at. spose your highest index is 4; an index of 0 will pull out 4 terms an index of 1 will pull out 3 terms an index of 2 will pull out 2 terms an index of 3 will pull out 1 terms

OpenStudy (anonymous):

ok. i must go now for a few i will try this problem from start. i still need to figure out to get final solution so i can use y(0) = 0 and y'(0)=0. but i super appreciate ur help!! if i could i would give you high five and hug! because u really help me well.

OpenStudy (anonymous):

if i dont see u later to help me if u can then i will say now have a great day!! :D

OpenStudy (anonymous):

so i asked friend about this question. he thinks the answer is much simpler. i dont know if it requires to be solved? just finding interval. he guesses that interval is \(\infty\) to 2. but why is that?

OpenStudy (anonymous):

@amistre64

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!