Linear recurrences
1.[2p] Solve with and . What is ?
Solve with and . What is ?
2.[1p] What is the larger root of the characteristic equation of ?
What is the larger root of the characteristic equation of ?
3.[2p] The Lucas numbers obey with and . With and , which formula gives ?
The Lucas numbers obey with and . With and , which formula gives ?
The answer is:
The answer is:
The answer is:
4.[2p] For , what is the largest possible difference between and , the bound that makes its nearest integer? Give it to three decimal places.
For , what is the largest possible difference between and , the bound that makes its nearest integer? Give it to three decimal places.
5.[2p] Solve with and . What is ?
Solve with and . What is ?
6.[2p] Solve with . What is ?
Solve with . What is ?
7.[2p] Solve with . What is ?
Solve with . What is ?
8.[3p] Match each recurrence to the form of its general solution.
Match each recurrence to the form of its general solution.
Show the answer
: : : :
9.[3p] Which of these statements are correct?
Which of these statements are correct?
Select all that apply
The answer is: If and both satisfy a linear homogeneous recurrence with constant coefficients, so does , If is a double root of the characteristic equation, both and satisfy the recurrence, Every solution of a recurrence with a forcing term is one particular solution plus a solution of the homogeneous recurrence
The answer is: If and both satisfy a linear homogeneous recurrence with constant coefficients, so does , If is a double root of the characteristic equation, both and satisfy the recurrence, Every solution of a recurrence with a forcing term is one particular solution plus a solution of the homogeneous recurrence
The answer is: If and both satisfy a linear homogeneous recurrence with constant coefficients, so does , If is a double root of the characteristic equation, both and satisfy the recurrence, Every solution of a recurrence with a forcing term is one particular solution plus a solution of the homogeneous recurrence