Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!- Dec 17
09:00 AM PST
-10:00 AM PST
Join Manhattan Prep instructor Whitney Garner for a fun—and thorough—review of logic-based (non-math) problems, with a particular emphasis on Data Sufficiency and Two-Parts. - Dec 18
10:00 AM PST
-11:00 AM PST
Here is the essential guide to securing scholarships as an MBA student! In this video, we explore the various types of scholarships available, including need-based and merit-based options.
Updated on: 23 Sep 2014, 15:05
Originally posted by mikemcgarry on 23 Sep 2014, 10:26.
Last edited by mikemcgarry on 23 Sep 2014, 15:05, edited 1 time in total.
Last edited by mikemcgarry on 23 Sep 2014, 15:05, edited 1 time in total.
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
15%
(low)
Question Stats:
80% (01:22) correct
20%
(01:26)
wrong
based on 163
sessions
History
Date
Time
Result
Not Attempted Yet
If a sequence is defined by \(a_n = (a_{n-1})*(a_{n-2})+1\) for all \(n\geq3\), and if \(a_1 = 1\) and \(a_2 = 1\), what is the 6th term?
(A) 1
(B) 7
(C) 22
(D) 155
(E) 721
For a discussion of questions involving sequences, especially recursive sequences such as this one, as well as the OE for this question, please see:
https://magoosh.com/gmat/2012/sequences-on-the-gmat/
Mike
(A) 1
(B) 7
(C) 22
(D) 155
(E) 721
For a discussion of questions involving sequences, especially recursive sequences such as this one, as well as the OE for this question, please see:
https://magoosh.com/gmat/2012/sequences-on-the-gmat/
Mike
23 Sep 2014, 13:22
Kudos
Bookmarks
mikemcgarry
[color=#0000ff]If a sequence is defined by \(a_n = (a_{n-1})*(a_{n-2})\) for all \(n\geq3\), and if \(a_1 = 1\) and \(a_2 = 1\), what is the 6th term?
As the question is written, the answer would be 1 (every term would be 1). If the correct answer is to be C here, I think you want the definition of the later terms to include a '+1' at the end:
\(a_n = (a_{n-1})*(a_{n-2})\) \(+ 1\) for all \(n\geq3\)
23 Sep 2014, 15:06
Kudos
Bookmarks
IanStewart
mikemcgarry
[color=#0000ff]If a sequence is defined by \(a_n = (a_{n-1})*(a_{n-2})\) for all \(n\geq3\), and if \(a_1 = 1\) and \(a_2 = 1\), what is the 6th term?
As the question is written, the answer would be 1 (every term would be 1). If the correct answer is to be C here, I think you want the definition of the later terms to include a '+1' at the end:
\(a_n = (a_{n-1})*(a_{n-2})\) \(+ 1\) for all \(n\geq3\)
Many thanks, my friend, for catching that typo. Yes, you are 100% correct: with the "+ 1," the sequence would be utterly trivial. I corrected it the original question.
Thanks again!
Mike
