Please show me how to simplify this recurrence relation

AI Thread Summary
The discussion revolves around simplifying the recurrence relation T(n) = 14 + T(n − 2) + 10(n + (n − 1)). The user seeks guidance on how to transform this into the form T(n) = (n − 1)7 + T(1) + 10(Σi=2 to n of i). There is confusion regarding the correct application of recursive functions and whether to substitute specific values for n. The user also questions the correctness of a coefficient in the equation and seeks clarification on the steps to derive T(n) - T(1). Detailed assistance is requested to navigate these transformations.
s3a
Messages
814
Reaction score
8
I'm doing a much larger problem and I am stuck going from:

T(n) = 14 + T (n − 2) + 10(n + (n − 1))
to
T(n) = (n − 1)7 + T(1) + 10(Σi=2 to n of i)

and I would very much appreciate it if someone could show me the detailed steps. (I've been told something about expanding the recursive functions but I'm having a lot of trouble doing it.)

Thanks in advance!
 
Physics news on Phys.org
hi s3a! :smile:
s3a said:
T(n) = 14 + T (n − 2) + 10(n + (n − 1))

so T(n) - T (n − 2) = 14 + 10(n + (n − 1))

so T(n) - T (1) = … ? :wink:
 
Are you sure that 7 shouldn't be 14?

EDIT: My mistake. 7 is correct.
 
Last edited:
I'm not sure of anything. That's what my sheet says.

Also, for the T(n) - T(n - 2) = ... thing, do I plug in n = 3? Or is that not what I am supposed to do?
 
If T(11) - T(9) = ... thing,

T(9) - T(7) = ... thing,



what is T(11) - T(1) ? :smile:
 
Back
Top