by esledge Tue Jul 28, 2009 3:53 pm
Indeed :-) It makes a difference whether that subtracted term is n or f(n)!
But in any case, I think we are seeing that recursive functions (those in which one term is defined somehow by another term in the sequence) require recursive solutions: f(6) put in terms of f(5), which is then put in terms of f(4), etc. Remember this anytime you see f(n-1) or f(n+1) or f(n-2) in a function/sequence definition.
Emily Sledge
Instructor
ManhattanGMAT