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

  • Thread starter Thread starter issoder
  • Start date Start date
  • Tags Tags
    Expression
AI Thread 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: 104
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
 
I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top