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.
May 1508:30 AM PDT
-09:30 AM PDT
Struggling with Boldface or Paradox questions in GMAT Critical Reasoning (CR)? Boldface and Paradox CR questions are often overlooked amidst the other more common GMAT CR question types. But mastering these can significantly boost your Verbal score.- May 15
10:00 AM PDT
-11:00 AM PDT
Struggling to finish the GMAT on time? You’re not alone. The #1 reason students score lower than expected on the GMAT isn’t lack of knowledge or silly mistakes—it’s running out of time. 
May 1609:00 PM PDT
-10:00 PM PDT
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
May 1706:30 AM PDT
-08:30 AM PDT
We know Strengthen and Weaken questions account for more than 50% of the CR questions on the GMAT. With CR becoming even more important on GMAT Focus, it's time you strengthen your weaknesses with an approach that improves your solving time and accuracy!
May 1711: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.- May 18
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. - Jun 10
06:00 AM PDT
-05:30 PM PDT
Register for the GMAT Club Virtual MBA Spotlight fair, the biggest MBA fair of the year. You will have a chance to hear Admissions directors from almost every Top 20 program speak, network with peers, and conveniently attend morning or afternoon sessions.
12 Jan 2012, 22:42
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
30% (02:29) correct
70%
(02:41)
wrong
based on 1207
sessions
History
Date
Time
Result
Not Attempted Yet
In a certain sequence, every term after the first is determined by multiplying the previous term by an integer constant greater than 1. If the fifth term of the sequence is less than 1000, what is the maximum number of non-negative integer values possible for the first term?
A) 60
B) 61
C) 62
D) 63
E) 64
A) 60
B) 61
C) 62
D) 63
E) 64
13 Jan 2012, 05:17
Kudos
Bookmarks
enigma123
In a certain sequence, every term after the first is determined by multiplying the previous term by an integer constant greater than 1. If the fifth term of the sequence is less than 1000, what is the maximum number of non-negative integer values possible for the first term?
A) 60
B) 61
C) 62
D) 63
E) 64
Any idea on the concept and how to solve this please?
A) 60
B) 61
C) 62
D) 63
E) 64
Any idea on the concept and how to solve this please?
Given sequence:
\(x\);
\(x*r\);
\(x*r^2\);
\(x*r^3\);
\(x*r^4<1,000\) (where x is the first term and r is the constant greater than 1).
To maximize the # of non-negative integer values possible for \(x\), we should minimize the value of \(r\) and since \(r=integer>1\) then \(r=2\). (General rule for such kind of problems: to maximize one quantity, minimize the others and to minimize one quantity, maximize the others.)
Thus, \(x*2^4<1,000\) -->\(x<\frac{1,000}{16}=62,5\) --> as the first term must be a non-negative integer then: \(x_{max}=62\) and \(x_{min}=0\) --> total of 63 values possible for the first term x: {0, 1, 2, ..., 62}.
Answer: D.
enigma123
In a certain sequence, every term after the first is determined by multiplying the previous term by an integer constant greater than 1. If the fifth term of the sequence is less than 1000, what is the maximum number of non-negative integer values possible for the first term?
A) 60
B) 61
C) 62
D) 63
E) 64
Any idea on the concept and how to solve this please?
A) 60
B) 61
C) 62
D) 63
E) 64
Any idea on the concept and how to solve this please?
You can solve the problem using equations or take a logical route.
I'll do it by logical elimination.
We are given the following: T1, T2, T3..T5 are 5 terms of a sequence, where T2 = K*T1 , T3=K*T2 [K> 1 & T5 < 1000]
To get the MAXIMUM number of non-negative integer values for T1 , we have to take the value of K as low as possible and K> 1 (given) therefore let us take K=2. Looking at the options we can figure out that value of T1 will be b/w 60-64.
Lets us start by the maximum value of 64.
T1=64, T2=128......T5=1024 (but T5 < 1000), hence E is out
T1=63,T2=126........T5=1008 ,Hence D is out
T1=62, T2=64.........T5= 992. This works .Thus all values from 1 to 62 will work .
But we are told that T1 is a non-negative integer, so T1=0 (zero) will also work. Thus 0 to 62 values will work . Therefore total number of values equals 63 .Option D.
Alternatively equations can be formed as shown above T (n+1) = K* Tn and T5 <1000. substutuite for T5=1000 and get T1 (T1=62.5) ,but T1 has to be integer therefore T1=62 ,then the method as above. Hope this helps
What is the source of the problem and the answer?
