Please show me how to simplify this recurrence relation

In summary, the conversation is about finding the equivalent form of a recursive function T(n) = 14 + T(n-2) + 10(n + (n-1)) in terms of n. The speaker is seeking help with the detailed steps and mentions difficulty with expanding the recursive functions. They also clarify that the coefficient 7 is correct and not 14.
  • #1
s3a
818
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
  • #2
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:
 
  • #3
Are you sure that 7 shouldn't be 14?

EDIT: My mistake. 7 is correct.
 
Last edited:
  • #4
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?
 
  • #5
If T(11) - T(9) = ... thing,

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



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

Related to Please show me how to simplify this recurrence relation

1. What is a recurrence relation?

A recurrence relation is a mathematical equation that defines a sequence of values by relating each term to one or more previous terms.

2. Why is it important to simplify a recurrence relation?

Simplifying a recurrence relation can help to better understand and analyze the pattern or behavior of the sequence it represents. It can also make it easier to solve for specific terms or find the overall solution.

3. How do I simplify a recurrence relation?

To simplify a recurrence relation, you can try to rewrite it in a different form or use mathematical techniques such as substitution, telescoping, or generating functions.

4. Are there any specific strategies for simplifying a recurrence relation?

Yes, there are various strategies that can be used to simplify a recurrence relation, such as breaking it down into smaller parts, using algebraic manipulations, or applying known formulas or identities.

5. Can simplifying a recurrence relation always lead to a closed-form solution?

No, simplifying a recurrence relation does not always result in a closed-form solution, as some recurrence relations may not have a simple and explicit formula for every term in the sequence. In such cases, approximation or recursive methods may be used instead.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
2
Views
867
  • Engineering and Comp Sci Homework Help
Replies
8
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
7
Views
969
  • Engineering and Comp Sci Homework Help
Replies
6
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
18
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
11
Views
1K
Replies
8
Views
1K
  • General Math
Replies
12
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
11
Views
1K
Back
Top