- #1
mr_coffee
- 1,629
- 1
Hello everyone.
I got the hard part of the problem done with help from another forum member,
and i transferred it into a gemeotric sum,
which i will show below but I'm confused on the following
directions that my profressor wrote:
I checked in the section he was talking about and to my luck, no problem
deals with what he is speaking of...but i do have an example of what he means.
In #8 on the image below, i have boxed the check in which he requires. #11. is where I'm stuck,
i'm not sure what I'm suppose to plug in, following his pattern for #8, it looks like he took
the right hand side of the given equation, and set it equal to the formula i found in replace
of f_{k-1} because there is a +2^k after the formula i found in #8 which was: f_n = 2^{n+1} - 3.Sorry if this is confusing but the directions to these problems are the following:
In eavch of 3-15 a sequence is defined recursively. Use iteration to guess
an explicit formula for the sequence.
and here is my work:
http://suprfile.com/src/1/4ni4e7l/lastscan.jpg Thanks!
I got the hard part of the problem done with help from another forum member,
and i transferred it into a gemeotric sum,
which i will show below but I'm confused on the following
directions that my profressor wrote:
Check your answers to 7, 8 and 11 by verifying that your formula satisfies the initial conditions,
and by checking that it satisfies the recurrence relation by substituting it into the recurrence
relation as in Exercise 8.1.9. Include the check as part of your write-up.
Your answer is incomplete if you turn it in without the check, or if you
turn it in even though it does not pass the check. An incomplete answer to 7, 8 or 11
will not be awarded any points, so don't bother turning one in. Instead, if your answer
does not check out, then fix it.
I checked in the section he was talking about and to my luck, no problem
deals with what he is speaking of...but i do have an example of what he means.
In #8 on the image below, i have boxed the check in which he requires. #11. is where I'm stuck,
i'm not sure what I'm suppose to plug in, following his pattern for #8, it looks like he took
the right hand side of the given equation, and set it equal to the formula i found in replace
of f_{k-1} because there is a +2^k after the formula i found in #8 which was: f_n = 2^{n+1} - 3.Sorry if this is confusing but the directions to these problems are the following:
In eavch of 3-15 a sequence is defined recursively. Use iteration to guess
an explicit formula for the sequence.
and here is my work:
http://suprfile.com/src/1/4ni4e7l/lastscan.jpg Thanks!
Last edited by a moderator: