Solve the first-order linear recurrence relation: Sn+1 = 5 Sn + 1, with S0=1.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Solve the first-order linear recurrence relation: Sn+1 = 5 Sn + 1, with S0=1. You may use the general solution given on P.342.
![8.2 Solving First-Order Linear Recurrence Equations
A first-order linear recurrence equation relates consecutive entries in a sequence
by an equation of the form
Sn+1 = aS, +c
for Vn in the domain of S.
(8.2.1)
But let's assume that the domain of S is N. Let's also assume that a + 0; otherwise,
S, = c for Vn > 0, and the solutions to (8.2.1) are not very interesting.
I/ What are they?
We saw in Chap. 3, that when a = 1, any sequence satisfying (8.2.1) is an
arithmetic sequence, and when S is defined on N and So is some initial value I,
S, = 1+nc
for Vn e N.
// Theorem 3.6.4
Also, when e = 0, any sequence satisfying (8.2.1) is a geometric sequence, and
when S is defined on N and So is some initial value I,
S, = d"I
for Vn e N.
I/ Theorem 3.6.7
Furthermore, Theorem 3.6.8 gives a formula for the sum of the first (n + 1) terms
of a geometric series when a + 1:
a°1+a'I+a²I+.. +a'I = 1(1+a+a² +... +a") = 1ª
а - 1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0f7775f3-edad-4f27-ba1b-f7886a7505bd%2F13a82245-574c-43e8-8585-49f9097bf6a5%2F6aswgg_processed.png&w=3840&q=75)
Transcribed Image Text:8.2 Solving First-Order Linear Recurrence Equations
A first-order linear recurrence equation relates consecutive entries in a sequence
by an equation of the form
Sn+1 = aS, +c
for Vn in the domain of S.
(8.2.1)
But let's assume that the domain of S is N. Let's also assume that a + 0; otherwise,
S, = c for Vn > 0, and the solutions to (8.2.1) are not very interesting.
I/ What are they?
We saw in Chap. 3, that when a = 1, any sequence satisfying (8.2.1) is an
arithmetic sequence, and when S is defined on N and So is some initial value I,
S, = 1+nc
for Vn e N.
// Theorem 3.6.4
Also, when e = 0, any sequence satisfying (8.2.1) is a geometric sequence, and
when S is defined on N and So is some initial value I,
S, = d"I
for Vn e N.
I/ Theorem 3.6.7
Furthermore, Theorem 3.6.8 gives a formula for the sum of the first (n + 1) terms
of a geometric series when a + 1:
a°1+a'I+a²I+.. +a'I = 1(1+a+a² +... +a") = 1ª
а - 1
![Therefore, the general solution of the recurrence equation
Sp+1 = aS, +c
for Vn eN
(8.2.1)
is given in two parts:
if a = 1,
S, = 1+nc
for Vn e N;
if a + 1,
S„ = a"A +•
for Vn e N.
When a = 1, any particular solution is obtained by determining a specific,
numerical value for I. In fact, a particular solution is determined by a specific,
numerical value J for any (particular) entry, S,. Solving the equation
J = I+jc for I,
1 = J – je.
I/ since S; = I+jc
// where So =1
we get
// One particular “particular solution" has I = 0.
When a + 1, any particular solution is obtained by determining a specific,
numerical value for A; if the starting value I is given, then A = 1-,
In fact,
1- a
a particular solution is determined by a specific, numerical value J for any
(particular) entry, S,. Solving the equation
J = Ad +
for A,
a
we get
A =
// But what if a = 0?
// One particular “particular solution" has A = 0.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0f7775f3-edad-4f27-ba1b-f7886a7505bd%2F13a82245-574c-43e8-8585-49f9097bf6a5%2F3h6f3p86q_processed.png&w=3840&q=75)
Transcribed Image Text:Therefore, the general solution of the recurrence equation
Sp+1 = aS, +c
for Vn eN
(8.2.1)
is given in two parts:
if a = 1,
S, = 1+nc
for Vn e N;
if a + 1,
S„ = a"A +•
for Vn e N.
When a = 1, any particular solution is obtained by determining a specific,
numerical value for I. In fact, a particular solution is determined by a specific,
numerical value J for any (particular) entry, S,. Solving the equation
J = I+jc for I,
1 = J – je.
I/ since S; = I+jc
// where So =1
we get
// One particular “particular solution" has I = 0.
When a + 1, any particular solution is obtained by determining a specific,
numerical value for A; if the starting value I is given, then A = 1-,
In fact,
1- a
a particular solution is determined by a specific, numerical value J for any
(particular) entry, S,. Solving the equation
J = Ad +
for A,
a
we get
A =
// But what if a = 0?
// One particular “particular solution" has A = 0.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)