Homework Help: Discrete Mathematics

Posted by Vevea Tepou on Thursday, October 25, 2012 at 8:46pm.

Suppose a0, a1, a2 ,... is a sequence defined recursively as follows:

a1 = 1, a2 = 2, a3 = 3 and ak = ak-1 + ak-2 + ak-3 for all integers k > 3.

Use strong induction to show that an < 2n for all integers n ≥ 1.

No one has answered this question yet.

Answer this Question

Related Questions

math - Show that the formula for a line through two points (a1,b1) and (a2,b2) ...
Sequences - A = {a1, a1 + d1, a1 + 2d1, …}, B = {a2, a2 + d2, a2 +2d2, &#...
Math sequence - Let {An} be the sequence defined recursively by A1=sqr(2) and A(...
Physics - 1. Question: Consider two planets with uniform mass distributions. The...
Math - List the elements {a1, a2, a3...} where an is defined as a1= 1, an=na(n-1...
math,correction&help - the problem asks: a bag contains 5 aplles and 3 ...
Physics - Suppose a nucleus of 93X236 fissions into two fragments whose mass ...
Pre-Cal - 1) Write the first five temrs of the geometric sequence a1 = 2 r=sqrt3...
Pre-Cal(Please help) - 1) Write the first five temrs of the geometric sequence ...
arithmetic - If a1,a2,a3 represents first, second, third terms in A.P. if the ...

For Further Reading

First Name:
School Subject:
Answer: