Help with linear homogeneous recurrence relations

Click For Summary
SUMMARY

The discussion centers on determining the order of the linear homogeneous recurrence relation defined by An = 2An-1. The correct interpretation of the order is established as 1, as An relies solely on the previous term An-1. Participants clarify that the order of a recurrence relation is defined by the number of preceding terms it depends on, which in this case is one. Additional confusion arises regarding the expression An = 2(2An-1 + 1) + 1, which participants note lacks a clear target value for verification.

PREREQUISITES
  • Understanding of linear homogeneous recurrence relations
  • Familiarity with constant coefficients in recurrence relations
  • Knowledge of mathematical notation and terminology
  • Basic skills in solving recurrence relations
NEXT STEPS
  • Research the definition and properties of linear homogeneous recurrence relations
  • Study methods for solving linear recurrence relations with constant coefficients
  • Explore examples of different orders of recurrence relations
  • Learn about the implications of initial conditions on recurrence relations
USEFUL FOR

Students studying discrete mathematics, mathematicians focusing on recurrence relations, and educators teaching concepts related to sequences and series.

Bucs44
Messages
57
Reaction score
0

Homework Statement


Here's my problem - Give the order of linear homogeneous recurrence relations with constant coefficients for: An = 2na(n-1)



The Attempt at a Solution

I have no idea on how to start this problem - Any help would be greatly appreciated.
 
Physics news on Phys.org
First, I think you mean An= 2An-1. Be careful to distinguish between "A" and "a"!

Notice that this problem does not (yet) ask you to solve the equation! It just asks that you state its order. Do you know the definition of "order" of a recurrence relation? I suspect the way to "start this problem" is to look up "order"!
 
=2(2An-1 + 1) + 1
=2^2An-1 + 2 + 1

Is this right?
 
The order is just the number of "previous" terms, in which case the order is 2
 
No, in the recursion An= 2An-1, An depends on the value of A one place before it. The order is 1.

As for
=2(2An-1 + 1) + 1
=2^2An-1 + 2 + 1

I can't tell whether it is correct or not because you haven't told me what it is supposed to equal!

Once again, is this intended to be An= 2Sn-1? If so, I cannot see where you are getting the "+1" terms from.

Suppose A0= 1. What is A1? A2?
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
1K
Replies
3
Views
3K