f(0)=7
f(n)=n^2 - f(n-1)
I have no idea how to do this, so any help will be appreciated:D
![]() |
f(0)=7
f(n)=n^2 - f(n-1)
I have no idea how to do this, so any help will be appreciated:D
Assuming that n takes on vaues 0, 1,2, 3... You already know that f(0) = 7. To find f(1), use the equation you were given with n = 1. Continue for n= 2, 3, 4, etc.
f(1) = 1^2 - f(0) = 1 - 7 = -6
f(2) = 2^2 - f(1) = 4 - (-6) =10
f(3) = 3^2 - f(2) = 9 - 10 = -1
etc.
Perhaps we can find a closed form. If we look close there is a pattern amongst the ven and odd recursions. I will useinstead of
.
![]()
.
.
.
.
Using finite difference or what not we find the closed form for the evens is
For the odds:
Combine the two and get:
Which can be written as
Notice the formula for the sum of the integers, plus or minus 7.
All times are GMT -7. The time now is 11:57 PM. |