sukhman wrote: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 nonnegative integer values possible for the first term?
A) 60 B) 61 C) 62 D) 63 E) 64
Let a� = the first term and a₅ = the fifth term.
To MAXIMIZE the number of options for a�, we must MINIMIZE the multiplier for the sequence.
Since the multiplier must be greater than 1, the smallest possible multiplier between successive terms = 2.
Implication:
a₅ = a� * 2 * 2 * 2 * 2
a₅ = 16a�.
Since aâ‚… < 1000, we get:
16a� < 1000.
a� < 1000/16.
Since 1000/16 ≈ 62, any integer between 0 and 62, inclusive, could be the value of a�:
If a� = 0, then a₅ = 16(0) = 0.
If a� = 1, then a₅ = 16(1) = 16.
If a� = 62, then a₅ = 16(62) = 992.
In every case, aâ‚… < 1000.
Since a� could be any integer between 0 and 62, inclusive, the total number of options for a� = 63.
The correct answer is
D.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3
