Wednesday
October 1, 2014

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.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Discrete Math - Calculate R(4) where the recursively defined sequence R is ...
math - A sequence of polynomials gk(x) is defined recursively as follows. g0(x)=...
algebra 2 - A sequence is defined recursively by a1=1,an=(an-1+1)^2. Write the ...
Fibonacci sequence - The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8 is ...
Math sequence - Let {An} be the sequence defined recursively by A1=sqr(2) and A(...
Algebra 2 Honors - Right now in my class i am learning about sequences and ...
precalculus - Find the first five terms of the given recursively defined ...
Discrete Math - Find f(1), f(2), and f(3) if f(n) is defined recursively by f(0...
math - *if it is in parentheses, it is subscripted. the sequence {a(n)} is ...
calculus - A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)...

Search
Members