recursively defined

This topic has expert replies
User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 am
Location: India
Thanked: 267 times
Followed by:80 members
GMAT Score:760

recursively defined

by sanju09 » Wed Jul 07, 2010 4:11 am
A sequence is recursively defined by a (n) = a (n - 1) + 2 a (n - 2), for n > 2. If a (1) = 0 and a (2) = 1, what is the value of a (6)?
(A) 5
(B) 8
(C) 11
(D) 13
(E) 21
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 1179
Joined: Sun Apr 11, 2010 9:07 pm
Location: Milpitas, CA
Thanked: 447 times
Followed by:88 members

by Rahul@gurome » Wed Jul 07, 2010 4:34 am
a(6) = a(5) + 2a(4)

a(3) = a(2) + 2a(1) implies a(3) = 1
a(4) = a(3) + 2a(2) implies a(4) = 1 + 2 = 3
a(5) = a(4) + 2a(3) implies a(5) = 3 + 2 = 5
So, a(6) = 5 + 2(3) = 11

The correct answer is (C).
Rahul Lakhani
Quant Expert
Gurome, Inc.
https://www.GuroMe.com
On MBA sabbatical (at ISB) for 2011-12 - will stay active as time permits
1-800-566-4043 (USA)
+91-99201 32411 (India)

User avatar
Master | Next Rank: 500 Posts
Posts: 324
Joined: Mon Jul 05, 2010 6:44 am
Location: London
Thanked: 70 times
Followed by:3 members

by kmittal82 » Wed Jul 07, 2010 4:41 am
Hmm, there is probably a quicker way of doing this, but here goes:

a(6) = a(5) + 2a(4)

Now,
a(5) = a(4) + 2a(3) - eq 1
a(4) = a(3) + 2a(2) - eq 2
a(3) = a(2) + 2a(1) => a(3) = 1

Putting in eq 2
a(4) = 1 + 2(1) = 3
Putting this in eq 1
a(5) = 3 + 2(1) = 5

Finally, a(6) now becomes => 5 + 2(3) = 11

So, the answer should be (C)