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

Solve the recurrence relation an=an-12/an-2if a0=1and a1=2. [Hint: Take logarithms of both sides to obtain a recurrence relation for the sequencelogan,n=0,1,2,]

Short Answer

Expert verified

The solution is

logan=lognan=2n

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-12an-2a0=1a1=2

02

Definition

The equation is said to be linear homogeneous difference equation if and only if R(n)=0and it will be of order n.

The equation is said to be linear non-homogeneous difference equation ifR(n)0.

03

SOLUTION HOMOGENEOUS RECURRENCE RELATION

Given:

an=an-12an-2a0=1a1=2

Take the logarithm of each side of the recurrence relation:

logan=logan-12an-2=logan-12-logan-2=2logan-1-logan-2loga0=log1=0loga1=log2=1

If we let bn=logan, then we obtain the following linear recurrence relation:

bn=2bn-1-bn-2b0=0b1=1

Let bn=r2,bn-1=rand bn-2=1

r2=2r-1r2-2r+1=0Characteristicequation(r-1)2=0r-1=0Zeroproductpropertyr=1

04

SOLUTION NON-HOMOGENEOUS RECURRENCE RELATION

The solution of the recurrence relation is of the forman=α1r1n+α2nr1n++αknk-1r1n

with r1a root with multiplicity kf the characteristic equation.

bn=α1·1n+α2·n·1n=α1+α2n

Use initial conditions:

0=b0=α11=b1=α1+α2

Determine α2

α2=1-α1=1-0=1

Thus, the sequence {bn}then becomes:

bn=α1+α2n=0+1·n=n

Using bn=logan

Hence, the solution is

logan=lognan=2n

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

47. A new employee at an exciting new software company starts with a salary of550,000and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$ 10,000 for each year she has been with the company.

a) Construct a recurrence relation for her salary for hern th year of employment.

b) Solve this recurrence relation to find her salary for hern th year of employment.

Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form \(f(n){a_n} = g(n){a_{n - 1}} + h(n)\)Exercises 48-50 illustrate this.

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}}\)

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

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

b) \({(3x - 1)^3}\)

c) \(1/\left( {1 - 2{x^2}} \right)\)

d) \({x^2}/{(1 - x)^3}\)

e) \(x - 1 + (1/(1 - 3x))\)

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

g) \(x/\left( {1 + x + {x^2}} \right)\)

h) \({e^{3{x^2}}} - 1\)

Suppose that the votes of npeople for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes.

a) Devise a divide-and-conquer algorithm that determines whether a candidate received a majority and, if so, determine who this candidate is. [Hint: Assume that nis even and split the sequence of votes into two sequences, each with n/2elements. Note that a candidate could not have received a majority of votes without receiving a majority of votes in at least one of the two halves.]

b) Use the master theorem to give a big-Oestimate for the number of comparisons needed by the algorithm you devised in part (a).

To prove every allowable arrangement of the ndisks occurs in the solution of this variation of the puzzle.

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