BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Divisibility Problem

Expert replies
by leumas » Sat Sep 10, 2011 2:49 am
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)

Seems to be mentally draining on reading OG 12, Q82 solution. Is there any simple solution to this?

I tried with factors, but it didn't work.
Join the discussion
Source: — Problem Solving |

by Anurag@Gurome » Sat Sep 10, 2011 2:58 am
leumas wrote: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)

Seems to be mentally draining on reading OG 12, Q82 solution. Is there any simple solution to this?

I tried with factors, but it didn't work.
Note that for the product of 3 numbers to be divisible by 3, one of the three numbers should be a multiple of 3.

(A) n(n + 1)(n - 4)
Adding 3 to n - 4, we get, 3 + (n - 4) = n - 1
So, n(n + 1)(n - 1), which are 3 consecutive integers, so their product will always be divisible by 3.

So, the correct answer is A.
Last edited by Anurag@Gurome on Sat Sep 10, 2011 3:14 am, edited 1 time in total.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by leumas » Sat Sep 10, 2011 3:05 am
Anurag@Gurome wrote:
leumas wrote: Note that for the product of 3 numbers to be divisible by 3, one of the three numbers should be a multiple of 3.

(A) n(n + 1)(n - 4)
Here n - 4 can be written as 3 + (n - 4) = n - 1
So, n(n + 1)(n - 4) = n(n + 1)(n - 1), which are 3 consecutive integers, so their product will always be divisible by 3.

So, the correct answer is A.
Thanks for the post. But can you explain the highlighted step.
Join the discussion

by Anurag@Gurome » Sat Sep 10, 2011 3:13 am
Thanks for the post. But can you explain the highlighted step.
Let us take n - 4 = 1, then n = 5 and n + 1 = 6
So, n(n + 1)(n - 4) = 5 * 6 * 1, which is clearly divisible by 3. Hence, option A.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by leumas » Sat Sep 10, 2011 3:20 am
Anurag@Gurome wrote:Let us take n - 4 = 1, then n = 5 and n + 1 = 6
So, n(n + 1)(n - 4) = 5 * 6 * 1, which is clearly divisible by 3. Hence, option A.
By the same logic

Option C: n-5 =1 , then n=6 and n+1 = 7 -> This is also divisible. It was given that n>6 also.
I am really confused, need a much more basic and simpler solution.
Join the discussion

by GMATGuruNY » Sat Sep 10, 2011 4:42 am
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
Join the discussion

by knight247 » Sat Sep 10, 2011 6:02 am
@leumas. Hope this post helps
I'm only gonna discuss the option A so lemme know if u need explanations for the rest
(A) n(n + 1)(n - 4)

Now, n-4 can be re-written as (n-1)-3 and substituting this value in the above eqn we get
n(n + 1)[(n-1)-3]. Opening only the second bracket we get

n(n+1)(n-1)-n(n+1)3
Rewriting it as

(n-1)n(n+1)-n(n+1)3

We'll break this into two parts

1st part
Now (n-1)n(n+1) are consecutive numbers. Keep in mind That the product of x consecutive numbers is always divisible by x! and therefore is divisible by x

So in the case of (n-1)n(n+1)...x=3 as there are three consecutive number and their product is obviously divisible by 3! and 3.

2nd part
n(n+1)3 . I guess you can figure that since there is a 3 in the product it will obviously be divisible by 3

So we can write the equation (n-1)n(n+1)-n(n+1)3 as Multiple of 3-Multiple of 3

Now, also keep in mind that If two multiples of a certain number are added/subtracted the resultant number will always be a multiple of that number

So if two multiples of 3 are added, obviously their sum will be divisible by 3. Hence A. However this problem is solved in a much quicker and efficient manner by just substituting numbers. Hope this clarifies ur doubts
Join the discussion