Question #b936a
2 Answers
I get
Explanation:
Beginning with
We see that
When we look for
We can see that
Motivated by the fact that we can find
Let
define
Using the recurrence definition above, we have:
# = 7T((2^k)/2) + 9/2(2^k)^2#
# = 7T(2^(k-1)) + 9/2(4^k)#
# = 7S(k-1) +9/2(4^k)#
Now we'll look for a pattern:
# = 7c+9/2(4^1)#
# = 7(underbrace(7c+9/2(4^1))_(S(1)))+9/2(4^2)#
# = 7^2c+9/2(7 * 4^1) + 9/2(4^2)#
# = 7(underbrace(7^2c+9/2(7 * 4^1) + 9/2(4^2))_(S(2)) )+9/2(4^3)#
# = 7^3c +9/2(7^2 * 4^1)+9/2(7 * 4^2) + 9/2(4^3)#
In general we have
I admit that I haven't worked out the sum myself, but my electronic helper says we get
# = 7^kc+9/2(underbrace(4/3(7^k-4^k))_"sum")#
So
Finally to return to the original problem replace
For
Extend the domain to all
Note that
See below.
Explanation:
Considering
This is a linear non homogeneous difference equation so the solution can be posed as
Now considering the homogeneous solution
now making
Handling now the particular solution and making
and then
now from the initial conditions
and finally