On the GMAT, problems about multiples are generally constrained to POSITIVE multiples.
I've amended the problem to reflect how it would appear on the GMAT.
kris610 wrote:
If S is a sequence of consecutive positive multiples of 3, how many multiples of 9 are there in S?
(1) There are 15 terms in S.
(2) The greatest term of S is 126.
A
Statement 1: There are 15 terms in S.
Among every 3 consecutive multiples of 3, exactly ONE will be a multiple of 9:
3,6,
9
6,
9,12
9,12,15
12,15,1
8
15,
18,21
18,21,24
The 15 terms in S = 5 cycles of 3 consecutive multiples of 3.
Within each cycle, there will be exactly ONE multiple of 9.
Thus, there will be 5 multiples of 9 in set S.
SUFFICIENT.
Statement 2: The greatest term of S is 126.
Without knowing the total number of terms, we can't determine how many multiples of 9 are in set S.
INSUFFICIENT.
The correct answer is
A.
Learn to recognize how the GMAT lays TRAPS.
Virtually every test-taker would recognize that given the number of terms (statement 1) and the greatest term (statement 2), we could simply count how many multiples of 9 are in set S.
If the OA is C, the question becomes TOO EASY.
Thus, the OA is probably
NOT C.
Whenever C seems too obvious an answer choice, be suspicious: there is a good chance that ONE of the two statements will be SUFFICIENT on its own.
Last edited by
GMATGuruNY on Tue Jun 17, 2014 4:32 am, edited 1 time in total.
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
