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
If i worked 7 1/3 hours and planted 11 trees how many hours did it take to plant each tree?

Draw the typical profile(s) of Shoppers'' Stop customers segments.



Q. How many permutations can you make of the word STATISTICS? Solution:  There are 10 letters in the word STATISTICS, i.e. n=10. Three of them are S's, so n 1 =3, three are T'

What percent of the figure below is shaded? Break the rectangle into eighths as shown below. The shaded part is 6/8 or 3/4; 3/4 is 75%.

Observe that natural numbers do not have a zero. This shortcoming is made good when we consider the set of whole numbers. The set of whole numbe

what is equizilent to 2/5

round to the nearest hundreths 1677.76

in the form of linear graph interpret the ralationship between two quantities