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
how to do fraction?

A class has 175 learners. The given table describes the number of learners studying one or more of the subsequent subjects in this case                 Subjects

how to know if it is function and if is relation

Write down the first few terms of each of the subsequent sequences. 1. {n+1 / n 2 } ∞ n=1 2. {(-1)n+1 / 2n} ∞ n=0 3. {bn} ∞ n=1, where bn = nth digit of ? So

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

There is a number. If the sum of digits is 14, and if 29 is subtracted from the number, the digits become equal. Find the number.

a company''s advertising expenditures average $5,000 per month. Current sales are $29,000 and the saturation sales level is estimated at $42,000. The sales-response constant is $2,

A Pythagorean triple is a set of positive integers (a,b,c) like  a2 + b2 = c2.  Write a function "ispythag" that will receive 3 positive integers (a, b, c in that order) and will r

who discovered unitary method??

A printer which sells for $190 is on sale for 20% off. What is the sale price of the printer? The printer is 20% off. That means that it is 80% of its original price (100% - 2