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

Prove Theorem 6.

Short Answer

Expert verified

P(k) is true, for all positive integers k.

Whens is not a root of the characteristic equation, then

ptnt+pt-1nt-1++p1n+p0sn is a particular solution.

When sis a root of the characteristic equation, then

nmptnt+pt-1nt-1++p1n+p0snis a particular solution.

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

Previous Theorem

Theorem 1

The solution of the recurrence relation is of the form an=α1r1n+α2r2nwhenr1andr2the distinct roots of the characteristic equation.

Theorem 2

The solution of the recurrence relation is of the formr1,r2,,rkan=α1r1n+α2nr1nwithr1a root with multiplicitykof the characteristic equation.

Theorem 3

If a characteristic equation has the distinct rootsr1,r2,,rk(each multiplicity l), then the recurrence relation has a solution of the form:an=α1r1n+α2r2n+.+αkrkn

02

Use previous theorem 1

an satisfies the linear non homogeneous recurrence relation

an=c1an-1+c2an-2++ckan-k+F(n)

c1,c2,,ck are real numbers

F(n)=btnt+bt-1nt-1++b1n+b0sn

b0,b1,,bt,s are real numbers

To proof: When is not a root of the characteristic equation, then

ptnt+pt-1nt-1++p1n+p0snis a particular solution.

When is a root of the characteristic equation, then

nmptnt+pt-1nt-1++p1n+p0snis a particular solution.

Let P(t) be "When sis not a root of the characteristic equation, then

ptnt+pt-1nt-1++p1n+p0snis a particular solution. When sis a root of the

characteristic equation, then nmptnt+pt-1nt-1++p1n+p0sn is a particular solution.

03

Use previous theorem 2

Let t=0and consider sis not a root, then:

c1an-1+c2an-2++ckan-k+F(n)=c1p0sn-1+c2p0sn-2+.+ckp0sn-k+b0snc1an-1+c2an-2++ckan-k+F(n)=p0an(h)+b0snc1an-1+c2an-2++ckan-k+F(n)=p0an(h)+F(n)

c1an-1+c2an-2++ckan-k+F(n)=anfor some choice of is a root

c1an-1+c2an-2++ckan-k+F(n)=c1p0(n-1)msn-1+c2p0(n-2)msn-2+.+ckp0(n-k)msn-k+b0snc1an-1+c2an-2++ckan-k+F(n)=p0(n-1)(n-2)(n-k)an(h)+F(n)

c1an-1+c2an-2++ckan-k+F(n)=anfor some choice ofp-0

Thus P(0) is true.

04

Use previous theorem 3

Let P(0),P(1),,P(k)be true.

When sis not a root of the characteristic equation, then

pknk+pk-1nk-1++p1n+p0snis a particular solution. When sis a root of the characteristic equation, then nmpknk+pk-1nk-1++p1n+p0snis a particular solution.

We need to proof thatP(k+1)is true and is not a rootc1an-1+c2an-2++ckan-k+F(n)=c1pk+1(n-1)k+1sn-1+c2pk+1(n-2)k+1sn-2+b0snc1an-1+c2an-2++ckan-k+F(n)=pk+1(n-1)k+1an(h)+b0snc1an-1+c2an-2++ckan-k+F(n)=pk+1(n-1)k+1+F(n)

c1an-1+c2an-2++ckan-k+F(n)=anfor some choice of is a root.

c1an-1+c2an-2++ckan-k+F(n)=c1pk+1(n-1)k+1sn-1+c2pk+1(n-2)k+1sn-2+b0snc1an-1+c2an-2++ckan-k+F(n)=pk+1(n-1)k+1an(h)+b0snc1an-1+c2an-2++ckan-k+F(n)=pk+1(n-1)k+1+F(n)

c1an-1+c2an-2++ckan-k+F(n)=anfor some choice of p-k+1

Thus pk+1nk+1snis a particular solution when is not a root.

However, pknk+pk-1nk-1++p1n+p0snis also a particular solution as P(k)is

true and thus pk+1nk+1sn+pknk+

pk-1nk-1++p1n+p0sn=pk+1nk+1+pknk+pk-1nk-1++p1n+p0snis also a particular solution.

Similarly, pk+1nmnk+1snis a particular solution when sis not a root. However,

nmpknk+pk-1nk-1++p1n+p0snis also a particular solution as P(k) is true and

thus pk+1nmnk+1sn+nmpknk+pk-1nk-1++p1n+p0sn=nmpk+1nk+1+pknk+pk-1nk-1++p1n+p0snis also a particular solution.

Thus P(k+1)is true.

By the principal of mathematical induction: P(k)is true, for all positive integers k.

When sis not a root of the characteristic equation, then

ptnt+pt-1nt-1++p1n+p0sn is a particular solution.

When sis a root of the characteristic equation, then

nmptnt+pt-1nt-1++p1n+p0snis a particular solution.

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

Give a big- \(O\) estimate for the function\(f\)in Exercise\(36\)if\(f\)is an increasing function.

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.

(Linear algebra required) Let \({{\bf{A}}_n}\) be the \(n \times n\) matrix with \(2\;{\rm{s}}\) on its main diagonal, 1s in all positions next to a diagonal element, and \(0\)s everywhere else. Find a recurrence relation for\({d_n}\), the determinant of \({{\bf{A}}_n}\) - Solve this recurrence relation to find a formula for\({d_n}\).

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

Find f(n)when n=2k, where fsatisfies the recurrence relation f(n)=f(n/2)+1with f(1)=1.

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