MHB SSome Help's question at Yahoo Answers regarding a linear recurrence equation

  • Thread starter Thread starter MarkFL
  • Start date Start date
  • Tags Tags
    Linear Recurrence
MarkFL
Gold Member
MHB
Messages
13,284
Reaction score
12
Here is the question:

Discrete Math Help questions?

Let {asubn} be the sequence defined recursively by asub1=11, asub2=37, asubn= 7asub(n-1) - 10asub(n-2) for n greater than or equal to 3.

a) find asub1, asub2, asub3, asub4.
b)Prove that asubn = 5^n + 3(2^n) for all n greater than or equal to 1.

Here is a link to the question:

Discrete Math Help questions? - Yahoo! Answers

I have posted a link there to this topic so the OP can find my response.
 
Mathematics news on Phys.org
Re: SSome Help's question at Yahoo! Answers regarding a linear reccurence equation

Hello SSome Help,

We are given the recursion:

$$a_n=7a_{n-1}-10a_{n-2}$$ where $$a_1=11,\,a_2=37$$

The associated characteristic equation is:

$$r^2-7r+10=(r-2)(r-5)=0$$

Hence, the closed-form expression will take the form:

$$a_n=k_12^n+k_25^n$$ where $$n\in\mathbb{N}$$

where the parameters $k_i$ may be determined from the initial values:

$$a_1=2k_1+5k_2=11$$

$$a_2=4k_1+25k_2=37$$

Solving this system, we find:

$$k_1=3,\,k_2=1$$

and so we have:

$$a_n=3\cdot2^n+5^n$$

a) We are given $a_1=11$ and $a_2=37$.

Using the recursive definition we find:

$$a_3=7\cdot37-10\cdot11=149$$

$$a_4=7\cdot149-10\cdot37=673$$

Using the closed-form we derived, we find:

$$a_3=3\cdot2^3+5^3=149$$

$$a_4=3\cdot2^4+5^4=673$$

b) We have already derived the closed-forum for the recursion.

To SSome Help and any other guests viewing this topic, I invite and encourage you to post other discrete math questions in our http://www.mathhelpboards.com/f15/ forum.

Best Regards,

Mark.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top