gettingstarted wrote:What is the best way to solve the Question below, is it by testing numbers or is there any other approach that can be tried, please suggest and explain the approach. Thanks
Q ) If n is an integer greater than 6, which of the following must be divisible by 3?
A) n(n+1)(n-4)
B) n(n+2)(n-1)
C) n(n+3)(n-5)
D) n(n+4)(n-2)
E) n(n+5)(n-6)
We can plug in numbers and eliminate any answer that is not a multiple of 3.
Let n=7:
A) n(n+1)(n-4) = 7*8*3, which is a multiple of 3. Hold onto A.
B) n(n+2)(n-1) = 7*9*6, which is a multiple of 3. Hold onto B.
C) n(n+3)(n-5) = 7*10*5, which is not a multiple of 3. Eliminate C.
D) n(n+4)(n-2) = 7*11*5, which is not a multiple of 3. Eliminate D.
E) n(n+5)(n-6) = 7*12*1, which is a multiple of 3. Hold onto E.
Let n=8:
A) n(n+1)(n-4) = 8*9*4, which is a multiple of 3. Hold onto A.
B) n(n+2)(n-1) = 8*10*7, which is not a multiple of 3. Eliminate B.
E) n(n+5)(n-6) = 8*13*2, which is not a multiple of 3. Eliminate E.
The correct answer is
A.
We also could reason our way to the correct answer.
Of every 3 consecutive integers, exactly one will be a multiple of 3:
1,2,3
2,3,4
3,4,5
4,5,6
Answer choice A includes n(n+1).
Of n-1, n, and n+1 -- three consecutive integers -- exactly one will be a multiple of 3.
If either n or n+1 is a multiple of 3, then n(n+1) will be a multiple of 3.
If neither n nor n+1 is a multiple of 3, then n-1 must be a multiple of 3.
If n-1 is a multiple of 3, so is n-4, since the distance between them = (n-1) - (n-4) = 3.
If n-4 is a multiple of 3, then n(n+1)(n-4) is a multiple of 3.
Thus, whatever the scenario, answer choice
A must be a multiple of 3.
I think plugging in numbers is MUCH easier.
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