Recursively, Mathematics

Let a0, a1 ::: be the series recursively defined by a0 = 1, and an = 3 + an-1 for n ≥ 1.

(a) Compute a1, a2, a3 and a4.

(b) Compute a formula for an, n ≥ 0.

(c) Use induction to show that your formula is right. 

Posted Date: 3/23/2013 12:56:33 AM | Location : United States

Related Discussions:- Recursively, Assignment Help, Ask Question on Recursively, Get Answer, Expert's Help, Recursively Discussions

Write discussion on Recursively
Your posts are moderated
Related Questions
A jeweler has bars of 18-carat gold and 12-carat gold. How much of every melted together to obtain a bar of 16-carat gold, weighing 120 gm ? It is given that pure gold is 24 carat.

Changing The Base Of The Index For comparison reasons if two series have different base years, this is difficult to compare them directly. In such cases, it is essential to ch

Question: Find Inverse Laplace Transform of the following (a) F(s) = (s-1)/(2s 2 +8s+13)     (b) F(s)= e -4s /(s 2 +1) + (1/s 3 )

let X be a nonempty set. let x belong to X. show that the collection l={ union subset of X : union = empty or belong U

show that a*0=a

A firm buys a product using the price schedule given in the table: The company estimate holding costs at 10% of the purchase price per year and ordering costs at $40 per order .