It is currently 19 Oct 2017, 15:35

### 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

Author Message
TAGS:

### Hide Tags

Magoosh GMAT Instructor
Joined: 28 Dec 2011
Posts: 4423

Kudos [?]: 8438 [1], given: 102

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

### Show Tags

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

Difficulty:

25% (medium)

Question Stats:

71% (00:54) correct 29% (01:26) wrong based on 157 sessions

### HideShow timer Statistics

Attachment:

AA sequence question.JPG [ 18.93 KiB | Viewed 2263 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

Kudos [?]: 8438 [1], given: 102

 Magoosh Discount Codes Manhattan GMAT Discount Codes Math Revolution Discount Codes
VP
Joined: 23 Mar 2011
Posts: 1112

Kudos [?]: 508 [0], given: 466

Concentration: Healthcare, Strategy
Schools: Duke '16 (M)

### Show Tags

01 Feb 2013, 04: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 )

Kudos [?]: 508 [0], given: 466

GMAT Club Legend
Joined: 09 Sep 2013
Posts: 16651

Kudos [?]: 273 [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, 12: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.
_________________

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

Re: If a sequence is defined by an = a(n-1)*a(n-2) + 1 for n>=3   [#permalink] 11 Sep 2015, 12:18
Display posts from previous: Sort by