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

Value of the game-game theory, Value Of The Game The game value refers ...

Value Of The Game The game value refers to the average pay off per play of the game over an extended period of time

Matrix, parts of matrix and functions

parts of matrix and functions

Find the sum of all natural numbers, Find the sum of all natural numbers am...

Find the sum of all natural numbers amongst first one thousand numbers which are neither divisible 2 or by 5 Ans:    Sum of all natural numbers in first 1000 integers which ar

Write down a game each for teach maths to children, Write down a game each ...

Write down a game each to teach children i) multiplication, ii) what a circle is, iii) estimation skills. Also say what you expect the child to know before you try to t

Statistics, the median of a continuous frequency distribution is 21.if each...

the median of a continuous frequency distribution is 21.if each observation is increased by 5. find the new median

Graphing sets of numbers, Q. Graphing Sets of Numbers? Ans. To  gr...

Q. Graphing Sets of Numbers? Ans. To  graph  a set of numbers on a number line means to plot, or locate, those positions on the line. The number that corresponds to a poin

Operations research, Solve the following Linear Programming Problem using S...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2, Subject to the constraints: X1+ X2 = 4 X1+ X2 = 2 X1, X2 = 0

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