Solve the recurrence relation, Mathematics

Assignment Help:

Solve the recurrence relation

T (K) = 2T (K-1), T (0) = 1

Ans: The following equation can be written in the subsequent form: 

tn - 2tn-1 =  0 

Here now successively replacing n by (n - 1) and then by (n - 2) and so on we obtain a set of equations.

The method is continued till terminating condition. Add these equations in such type of a way that all intermediate terms get cancelled. The equation can be rearranged as 

1709_Solve the recurrence relation.png

Multiplying all the equations correspondingly by 20, 21, ..., 2n - 1 and then adding them together, we get

tn - 2nt0 = 0 

or,  tn = 2n


Related Discussions:- Solve the recurrence relation

Determine all possible solutions to ivp, Determine all possible solutions t...

Determine all possible solutions to the subsequent IVP. y' = y ? y(0) = 0 Solution : First, see that this differential equation does NOT satisfy the conditions of the th

Tutor, How to be an expert at expertsmind

How to be an expert at expertsmind

Describe the sample of exponents , Describe the Sample of Exponents ? I...

Describe the Sample of Exponents ? Imagine, for example, that you are the P.E. coach at your school, and you need to divide one of your classes into teams. Your team has 45 stu

Types of series - special series , Series - Special Series In this pa...

Series - Special Series In this part we are going to take a concise look at three special series.  In fact, special may not be the correct term.  All three have been named th

How many inches is the smaller dimension of the decreased, A photographer d...

A photographer decides to decrease a picture she took in sequence to fit it within a certain frame. She requires the picture to be one-third of the area of the original. If the ori

Find out the minimum distance from the origin, Problem 1. Find the maximum...

Problem 1. Find the maximum and the minimum distance from the origin to the ellipse x 2 + xy + y 2 = 3. Hints: (i) Use x 2 + y 2 as your objective function; (ii) You c

Invertible Matrices - Logical equivalence, 10 statements must be shown to b...

10 statements must be shown to be logically equivalent to the Statement the nxn matrix is invertible.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd