Thread: Proof: recursive and closed formulas

..

Originally Posted by mathh18

i'm trying to prove that recursive formula 2[a(sub)k-1] -3 and closed formula [a(sub)n]= 2^(n-1) +3 are equal.
i have [a(sub)m] = 2[a(sub)m-1]-3 =
2(2^(m-3)+3) -3 =
2^(m-2) +3
that is close, but slightly off than what i'm trying to prove..what should i do to make it 2^(m-1) +3 ?

sorry for the typing, it's confusing on the computer

You can learn to use LaTeX.
[tex]a_n =2^{n-1}-3[/tex] gives .

Originally Posted by mathh18

i'm trying to prove that recursive formula 2[a(sub)k-1] -3 and closed formula [a(sub)n]= 2^(n-1) +3 are equal.
i have
[a(sub)m] = 2[a(sub)m-1]-3 =
2(2^(m-3)+3) -3 =
2^(m-2) +3
that is close, but slightly off than what i'm trying to prove..what should i do to make it 2^(m-1) +3 ?

sorry for the typing, it's confusing on the computer

I think this says prove that . Know induction?

sort of..i'm in the process of learning it. how does it work?

Originally Posted by mathh18

sort of..i'm in the process of learning it. how does it work?

Your English teachers lied, this is your bff

..

Originally Posted by mathh18

haha yeah! that's what i'm doing. i made a chart for n=1 and n=2 n=m-1 to show its true for all of those values. then i tried proving it for m and got stuck

Much simpler than that. Note that if we assume that then

thanks that makes sense. i also just found a really stupid error in my work.
got it now!