If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3 : GMAT Problem Solving (PS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 21 Jan 2017, 11:50

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Magoosh GMAT Instructor
Joined: 28 Dec 2011
Posts: 3706
Followers: 1297

Kudos [?]: 5852 [1] , given: 66

If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3 [#permalink]

### Show Tags

31 Jan 2013, 10:05
1
KUDOS
Expert's post
1
This post was
BOOKMARKED
00:00

Difficulty:

25% (medium)

Question Stats:

70% (01:56) correct 30% (01:30) wrong based on 140 sessions

### HideShow timer Statistics

Attachment:

AA sequence question.JPG [ 18.93 KiB | Viewed 2083 times ]

(A) 1
(B) 7
(C) 22
(D) 155
(E) 721

For help with sequence questions on the GMAT, as well as a complete solution to this question, see this post:
http://magoosh.com/gmat/2012/sequences- ... ment-13543

Experts --- feel free to share any tips you would like about sequences, especially recursive sequence such as this one.

Mike
[Reveal] Spoiler: OA

_________________

Mike McGarry
Magoosh Test Prep

 Magoosh Discount Codes Optimus Prep Discount Codes EMPOWERgmat Discount Codes
VP
Joined: 23 Mar 2011
Posts: 1113
Concentration: Healthcare, Strategy
Schools: Duke '16 (M)
Followers: 78

Kudos [?]: 496 [0], given: 463

Re: recursive sequence [#permalink]

### Show Tags

01 Feb 2013, 03:37
I'm not an expert, but, in my opinion GMAT doesn't go too far with recursive sequences.
most of the questions I've seen are like this one - substituting numbers into a term repeatedly till you get the answer. Therefore, the most important things on these questions are not getting bogged down by the length of calculations and not making a stupid calculation error. ( I wrote things way neater than usual on my scratch pad when I had to do recursive calculations )
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 13485
Followers: 576

Kudos [?]: 163 [0], given: 0

Re: If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3 [#permalink]

### Show Tags

11 Sep 2015, 11:18
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3   [#permalink] 11 Sep 2015, 11:18
Similar topics Replies Last post
Similar
Topics:
2 The sequence S is defined as follows for all n ≥ 1: The sum of the 7 17 Jun 2015, 05:00
5 The sequence S is defined as Sn = (n + 1)! 4 27 Dec 2014, 15:29
3 If a sequence is defined by a_n = (a_(n-1))*(a_(n-2)) for all n >=3 3 23 Sep 2014, 09:26
17 In the sequence 1, 2, 2, …, an, …, an = an-1 • an-2. 5 26 Jul 2013, 11:02
A sequence is defined as follows: a(n)= (n)/(n+1) If n is a 8 12 Oct 2008, 05:01
Display posts from previous: Sort by

# If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group and phpBB SEO Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.