Search the courses, subjects, tracks, games and features, or jump straight to a page.
Learn it your way
A short class with Sarah and her students. The other ways are under More.
Sign up free to listen. Transcripts are free to read.
Today, we'll discuss linear homogeneous recurrence equations with repeated characteristic roots. Can anyone remind me what a characteristic root is?
Isn’t it the solution to the characteristic equation of the recurrence relation?
Exactly! Now, when we had distinct roots, we expressed the n-th term as a combination of the roots raised to their powers. What do you think changes when roots are repeated?
Maybe we can’t form multiple distinct terms anymore?
Right! Instead of distinct roots, we focus on polynomial terms. If we have a root of multiplicity 2, for instance, we use a polynomial of degree 1. This is crucial for the general form of the solution.
So, it’s like we have to account for the root's repetition in the solution?
Exactly! Great observation. Let’s summarize: when roots are repeated, we use polynomials to reflect their multiplicities in our general solutions.
Now, regarding the general form of sequences with repeated roots, can anyone tell me how we would write the n-th term?
I think we would need a polynomial multiplied by the root raised to the power n?
Spot on! For a root with multiplicity , we would have terms like , where is a polynomial of degree . Can someone give an example of this?
If our root is 3 with multiplicity 2, then we’d have ?
Exactly! That leads to a general solution of the form . Let’s practice summarizing this form shortly.
Let’s move to initial conditions now. Why do you think they’re important when we have repeated roots?
They help us determine the specific constants in our general form, right?
Correct! Without initial conditions, we can only express the solution in its general form. Can anyone explain how we modify it to find unique sequences?
By plugging in the initial values into the general formula, we can set up equations to solve for the constants.
Exactly! If we have enough initial conditions, we can uniquely determine the constants that fit those conditions. A solid understanding of this is crucial. Let’s summarize the steps: Form the characteristic equation, derive the general form, then apply initial conditions.
Let’s look at an example. For a recurrence relationship of the form , how would we find the characteristic equation?
It would be !
Great! Now, what do we find when we solve it?
The roots are both 3, so we have a repeated characteristic root!
Exactly! Hence, we write the general solution as . If we had initial conditions like , we would substitute those to find and .
This approach makes it way clearer!
Repeated roots need some care, Polynomials we must prepare!
Imagine a party with guests (roots) arriving. Some bring friends (multiplicities), and together, they create new combinations (polynomials) for the fun (solutions)!
R-P-P (Roots - Polynomial - Solutions) helps remember the order of steps in dealing with repeated roots.
MARS: Multiply, Alternate forms, Roots, Substitute initial conditions.
Term
Characteristic Equation
Click to flip
Term
Polynomial Degree
Click to flip
A solution to the characteristic equation associated with a recurrence relation, used to define the general solution.
The number of times a particular root appears in the characteristic equation.
An algebraic expression consisting of terms, typically involving powers of a variable.
This section discusses solving linear homogeneous recurrence equations in the context of repeated characteristic roots, explaining how the general form of solutions changes from cases of distinct roots.
The section elaborates on linear homogeneous recurrence equations with repeated roots, highlighting the differences in general solution forms compared to distinct roots. It provides examples and proofs, emphasizing the importance of initial conditions in determining exact sequences.
In this section, we continue our exploration of linear homogeneous recurrence equations, focusing specifically on cases where characteristic roots are repeated. We begin by summarizing the previous discussion about distinct roots and then shift our attention to the scenario of repeated roots, specifically with a degree of 2 for illustration. The general form of the solutions is introduced, showing that when roots are distinct, the n-th term of the sequence can be expressed as a linear combination of the characteristic roots raised to their respective powers. However, when roots are repeated, such as having two identical roots, the solution must involve polynomial factors, namely a polynomial of degree corresponding to the root's multiplicity. The section outlines how to derive exact sequences when initial conditions are provided, exemplifying the process and guiding through sample equations to illustrate the concepts effectively. Overall, understanding the structure of these solutions significantly impacts solving recurrence relations in discrete mathematics.