Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Find the solutions of the simultaneous system of recurrence relations,

an=an-1+bn-1bn=an-1-bn-1a0=1b0=2

Short Answer

Expert verified

The solutions of recurrence are

a2k=2ka2k+1=3·2kb2k=2k+1b2k+1=-2k

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

We have given,

an=an-1+bn-1bn=an-1-bn-1a0=1b0=2

02

Definition

A recurrence relation is an equation that recursively defines a sequence where the next term is a function of the previous terms.

03

Adding the recurrence relations

Given:

an=an-1+bn-1bn=an-1-bn-1a0=1b0=2

Add the two recurrence relations:

an+bn=2an-1+bn-1-bn-1

Solve the equation to bn:

bn=2an-1-an

Let us then use bn-1=2an-1-an-1in the first recurrence relation.

an=an-1+bn-1=an-1+2an-2-an-1=2an-2

an=2an-2

a=01

a1=a0+b0=1+2=3

04

Simplify the recurrence relation

Repeatedly apply the recurrence relation
neven

There exists an integer ksuch that n=2k

an=a2k=2an-2=22an-4=2ka0=2k

nodd

There exists an integer ksuch thatn=2k+1

an=a2k+1=2ak-1=22ak-3=2ka1=3·2k

Thus, we have then solved the recurrence relation of an.

bn=2an-1-an

Use the recurrence relation of ana2k=2kand a2k+1=3·2k

b2k=2a2k-1-a2k=2a2(k-1)+1-a2k=2·3·2k-1-2k=3·2k-2k=2·2k=2k+1b2k+1=2a2k-a2k+1=2·2k-3·2k=(2-3)·2k=(-1)·2k=-2k

Hence, the solutions of recurrence are

a2k=2ka2k+1=3·2kb2k=2k+1b2k+1=-2k

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

For each of these generating functions, provide a closed formula for the sequence it determines.

a) \({(3x - 4)^3}\)

b) \({\left( {{x^3} + 1} \right)^3}\)

c) \(1/(1 - 5x)\)

d) \({x^3}/(1 + 3x)\)

e) \({x^2} + 3x + 7 + \left( {1/\left( {1 - {x^2}} \right)} \right)\)

f) \(\left( {{x^4}/\left( {1 - {x^4}} \right)} \right) - {x^3} - {x^2} - x - 1\)

g) \({x^2}/{(1 - x)^2}\)

h) \(2{e^{2x}}\)

Find a closed form for the generating function for each of these sequences. (Assume a general form for the terms of the sequence, using the most obvious choice of such a sequence.)

a) \( - 1, - 1, - 1, - 1, - 1, - 1, - 1,0,0,0,0,0,0, \ldots \)

b) \(1,3,9,27,81,243,729, \ldots \)

c) \(0,0,3, - 3,3, - 3,3, - 3, \ldots \)

d) \(1,2,1,1,1,1,1,1,1, \ldots \)

e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),2\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),{2^2}\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,{2^7}\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0, \ldots \)

f) \( - 3,3, - 3,3, - 3,3, \ldots \)

g) \(0,1, - 2,4, - 8,16, - 32,64, \ldots \)

h) \(1,0,1,0,1,0,1,0, \ldots \)

Find the solution of the recurrence relation an=3an-1-3an-2+an-3if a0=2,a1=2, anda2=4.

Find the solution to the recurrence relation,

\(f\left( n \right) = f\left( {\frac{n}{2}} \right) + {n^2}\)

For \(n = {2^k}\)

Where \(k\) is a positive integer and

\(f\left( 1 \right) = 1\).

Find a closed form for the generating function for each of these sequences. (For each sequence, use the most obvious choice of a sequence that follows the pattern of the initial terms listed.)

a) \(0,2,2,2,2,2,2,0,0,0,0,0, \ldots \)

b) \(0,0,0,1,1,1,1,1,1, \ldots \)

c) \(0,1,0,0,1,0,0,1,0,0,1, \ldots \)

d) \(2,4,8,16,32,64,128,256, \ldots \)

e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0,0, \ldots \)

f) \(2, - 2,2, - 2,2, - 2,2, - 2, \ldots \)

g) \(1,1,0,1,1,1,1,1,1,1, \ldots \)

h) \(0,0,0,1,2,3,4, \ldots \)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free