MHB How Can You Find an Expression for t(n)?

  • Thread starter Thread starter issoder
  • Start date Start date
  • Tags Tags
    Expression
Click For Summary
To find an expression for the sequence defined by the recurrence relation t_{n+1} = 2t_n + 4 with initial condition t_0 = 2, the solution involves solving the corresponding homogeneous equation and finding particular solutions. The general solution takes the form t_n = A(1^n) + B(2^n), where A and B are constants determined by initial conditions. By substituting the known values t_0 = 2 and t_1 = 8 into the equations, the constants A and B are found to be -4 and 6, respectively. Thus, the final expression for t_n is t_n = 6 * 2^n - 4. This method illustrates the process for solving first-order linear difference equations effectively.
issoder
Messages
1
Reaction score
0
hi all,

Would it be possible for you to explain how to reach a solution for this question, or explain the process that you need to find the solution
View attachment 2469

thank you
 

Attachments

  • Screen Shot 2014-05-11 at 1.34.13 pm.png
    Screen Shot 2014-05-11 at 1.34.13 pm.png
    5.8 KB · Views: 105
Physics news on Phys.org
issoder said:
hi all,

Would it be possible for you to explain how to reach a solution for this question, or explain the process that you need to find the solution
View attachment 2469

thank you

Wellcome on MHB issoder!...

The general procedure for solving a first order linear difference equation is illustrated here...

http://mathhelpboards.com/discrete-mathematics-set-theory-logic-15/difference-equation-tutorial-draft-part-i-426.html#post2494

This is one of simplest cases because the coefricients are constant. A difference equation in the form...

$\displaystyle t_{n+1} = \alpha\ t_{n} + \beta,\ t_{0}=a (1)$

... has solution...

$\displaystyle t_{n} = a\ \alpha^{n} + \beta\ \frac{1 - \alpha^{n}}{1 - \alpha}\ (2)$

In Your case is $\alpha= 2$, $\beta=4$ and $a=2$ so that is $\displaystyle t_{n} = 2^{n+2} + 2^{n+1} - 4$...

Kind regards

$\chi$ $\sigma$
 
Hello, issoder!

Let t_o,t_1,t_2,\cdots be a sequence defined by:
. . t_0 \:=\:2
. . t_{n+1} \:=\:2t_n+4

Find an expression for t_n.
\begin{array}{cccccc}\text{We are given:} & t_{n+1} &=& 2t_n + 4 & [1] \\ \text{Next term:} & t_{n+2} &=& 2t_{n+1} + 4 & [2] \end{array}

\text{Subtract [2]-[1]: }\;t_{n+2} - t_{n+1} \;=\;2t_{n+1} - 2t_n

. . . . . . . t_{n+2} - 3t_{n+1} + 2t_n \;=\;0

Let X^n = t_n\!:\;\;X^{n+2} - 3X^{n+1} + 2X^n \;=\;0

Divide by X^n\!:\;\;X^2 - 3X + 2 \;=\;0

Then: .(X-1)(X-2) \:=\:0 \quad\Rightarrow\quad X \:=\:1,2

The function is: .f(n) \:=\: (1^n)A + (2^n)B

We know the first two terms: t_0 = 2,\;t_1 = 8

\begin{array}{cccccc}f(0) = 2: & A + B &=& 2 & [3] \\ f(1) = 8: & A + 2B &=& 8 & [4] \end{array}

Subtract [4]-[3]: .B = 6 \quad\Rightarrow\quad A = -4

Hence: .f(n) \;=\;-4(1^n) + 6(2^n)

Therefore: .\t_n \;=\;f(n) \;=\;6\!\cdot\!2^n - 4
 
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
7
Views
2K
Replies
8
Views
5K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K