I don't know what method is referred to in "section 4.3", but I'll suppose it's reduction of order and use that to find the exact solution. Take

, so that

and we're left with the ODE linear in

:

Now suppose

has a power series expansion



Then the ODE can be written as


![\displaystyle\sum_{n\ge2}\bigg[n(n-1)a_n-(n-1)a_{n-1}\bigg]x^{n-2}=0](https://tex.z-dn.net/?f=%5Cdisplaystyle%5Csum_%7Bn%5Cge2%7D%5Cbigg%5Bn%28n-1%29a_n-%28n-1%29a_%7Bn-1%7D%5Cbigg%5Dx%5E%7Bn-2%7D%3D0)
All the coefficients of the series vanish, and setting

in the power series forms for

and

tell us that

and

, so we get the recurrence

We can solve explicitly for

quite easily:

and so on. Continuing in this way we end up with

so that the solution to the ODE is

We also require the solution to satisfy

, which we can do easily by adding and subtracting a constant as needed:
Final Answer: No Solution
Steps/Reasons/Explanation:
Question: 
<u>Step 1</u>: Divide both sides by
.

<u>Step 2</u>: Expand.

<u>Step 3</u>: Since
is false, we have no solution.
No Solution
~I hope I helped you :)~
Common ratio, r is found by dividing the next term by the previous term
r =

= -3
you can see this value is true for any consecutive pairs of terms
also, multiply by -3 to get the next term
Answer:
Mia has a bag that contains a letter block for each of the 26 letters of the alphabet. She draws a letter block from the bag, writes down the letter, and puts the block back in the bag. She repeats this 26 times. The results show that she drew a vowel (A, E, I, O, or U) 6 times.
Step-by-step explanation:
Answer:the area is 28.27
Step-by-step explanation:
im just that good