Last visit was: 18 Nov 2025, 21:06 It is currently 18 Nov 2025, 21:06
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [2]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [2]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 435
Own Kudos:
Given Kudos: 5,898
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 435
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,331
 [1]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Kimberly77

Hi BrentGMATPrepNow, for answer choice A : (A) 7(7 + 1)(7 – 4) = (7)(8)(3) = 7+8+3 = 21/3 Divisible by 3 so correct answer choice.
Is this way of calculation is correct? Thanks Brent

For this question, n can have any integer value.
So, by testing possible values of n, we can only eliminate answer choices.
For example, after testing n = 7, we were able to eliminate only 2 answer choices.

This means we need to keep testing other values of n until we have eliminated four of the five answer choices.

In other words, just because n = 7 resulted in answer choice A being divisible by 3, we can't just stop there and assume none of the other answer choices will be divisible by 3.
User avatar
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 435
Own Kudos:
Given Kudos: 5,898
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 435
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BrentGMATPrepNow
Kimberly77

Hi BrentGMATPrepNow, for answer choice A : (A) 7(7 + 1)(7 – 4) = (7)(8)(3) = 7+8+3 = 21/3 Divisible by 3 so correct answer choice.
Is this way of calculation is correct? Thanks Brent

For this question, n can have any integer value.
So, by testing possible values of n, we can only eliminate answer choices.
For example, after testing n = 7, we were able to eliminate only 2 answer choices.

This means we need to keep testing other values of n until we have eliminated four of the five answer choices.

In other words, just because n = 7 resulted in answer choice A being divisible by 3, we can't just stop there and assume none of the other answer choices will be divisible by 3.

I see thanks BrentGMATPrepNow. So this type of question will be the exception to total number addition that is divisible by 3 rule then.
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Kimberly77


I see thanks BrentGMATPrepNow. So this type of question will be the exception to total number addition that is divisible by 3 rule then.
I'm not sure I follow what you're saying.
Can you give me an example of how this question type is an exception to the "divisible by 3" rule?
User avatar
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 435
Own Kudos:
Given Kudos: 5,898
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 435
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BrentGMATPrepNow
Kimberly77


I see thanks BrentGMATPrepNow. So this type of question will be the exception to total number addition that is divisible by 3 rule then.
I'm not sure I follow what you're saying.
Can you give me an example of how this question type is an exception to the "divisible by 3" rule?

In the testing part BrentGMATPrepNow

answer choice A : (A) 7(7 + 1)(7 – 4) = (7)(8)(3) = 7+8+3 = 21/3 Divisible by 3
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Kimberly77
BrentGMATPrepNow
Kimberly77


I see thanks BrentGMATPrepNow. So this type of question will be the exception to total number addition that is divisible by 3 rule then.
I'm not sure I follow what you're saying.
Can you give me an example of how this question type is an exception to the "divisible by 3" rule?

In the testing part BrentGMATPrepNow

answer choice A : (A) 7(7 + 1)(7 – 4) = (7)(8)(3) = 7+8+3 = 21/3 Divisible by 3

I'm not sure I follow why you are taking the product (7)(8)(3) and making it equal to the sum 7+8+3.
(7)(8)(3) = 168, whereas 7+8+3 = 18

Also, how do you get 21/3?
User avatar
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 435
Own Kudos:
Given Kudos: 5,898
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 435
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Brent BrentGMATPrepNow. My bad in typo of 21 as it should be 7+8+3 = 18.
I divide it by 3 due to question asked which of the following must be divisible by 3 ? So I used the divisibility by 3 rule here that if the addition of 7+8+3 = 18 is divisible by 3 then it must be the right answer. Is the reasoning wrong here? Thanks Brent
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,331
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Kimberly77
Thanks Brent BrentGMATPrepNow. My bad in typo of 21 as it should be 7+8+3 = 18.
I divide it by 3 due to question asked which of the following must be divisible by 3 ? So I used the divisibility by 3 rule here that if the addition of 7+8+3 = 18 is divisible by 3 then it must be the right answer. Is the reasoning wrong here? Thanks Brent

The divisibility rule you are thinking of goes like this: If the sum of the digits of integer N is divisible by 3, then N is divisible by 3.
So for example, if N = 60015, then the sum of the digits of integer N = 6+0+0+1+5 = 12.
Since 12 is divisible by 3, we can conclude that 60015 is divisible by 3

For our question, N = the product (7)(8)(3)
In other words, N = 168 (notice that 7, 8, and 3 are not the three digits of 168)
Now, when we add the digits of 168, we get 1+6+8 = 15
Since 15 is divisible by 3, we can conclude that 168 is divisible by 3

Applying your rule will get you into trouble.
For example, if N = (2)(2)(2), we can't just add 2+2+2 to get 6, and then conclude that N (which actually equals 8) is divisible by 3
User avatar
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 435
Own Kudos:
Given Kudos: 5,898
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 435
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
BrentGMATPrepNow
Kimberly77
Thanks Brent BrentGMATPrepNow. My bad in typo of 21 as it should be 7+8+3 = 18.
I divide it by 3 due to question asked which of the following must be divisible by 3 ? So I used the divisibility by 3 rule here that if the addition of 7+8+3 = 18 is divisible by 3 then it must be the right answer. Is the reasoning wrong here? Thanks Brent

The divisibility rule you are thinking of goes like this: If the sum of the digits of integer N is divisible by 3, then N is divisible by 3.
So for example, if N = 60015, then the sum of the digits of integer N = 6+0+0+1+5 = 12.
Since 12 is divisible by 3, we can conclude that 60015 is divisible by 3

For our question, N = the product (7)(8)(3)
In other words, N = 168 (notice that 7, 8, and 3 are not the three digits of 168)
Now, when we add the digits of 168, we get 1+6+8 = 15
Since 15 is divisible by 3, we can conclude that 168 is divisible by 3

Applying your rule will get you into trouble.
For example, if N = (2)(2)(2), we can't just add 2+2+2 to get 6, and then conclude that N (which actually equals 8) is divisible by 3

Great explanation BrentGMATPrepNow and crystal clear now. Divisibility by 3 rule apply to whole digit only and not product of digit. :thumbsup: :please:
User avatar
Vegita
Joined: 23 May 2020
Last visit: 08 Sep 2025
Posts: 86
Own Kudos:
Given Kudos: 1,528
Posts: 86
Kudos: 12
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avigutman

I have a question. In your analysis of incorrect option (B) You mentioned (n+2) and (n-1) are from the same camp but you ignored n.

I understood the logic that if (n+2) is not divisible by 3, then so will (n-1) as the distance between them is 3. However, n can be divisible by 3. I understand that this is a must be true question and therefore, we are trying to prove the option wrong. But my question is why did you not go the extra route to make sure the 'n' is not divisible by 3 in option B?

Precise timing on video: 24 mintues
User avatar
avigutman
Joined: 17 Jul 2019
Last visit: 30 Sep 2025
Posts: 1,293
Own Kudos:
1,930
 [1]
Given Kudos: 66
Location: Canada
GMAT 1: 780 Q51 V45
GMAT 2: 780 Q50 V47
GMAT 3: 770 Q50 V45
Expert
Expert reply
GMAT 3: 770 Q50 V45
Posts: 1,293
Kudos: 1,930
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Vegita
I understand that this is a must be true question and therefore, we are trying to prove the option wrong. But my question is why did you not go the extra step to make sure that 'n' is not divisible by 3 in option B?
Thanks for the question, Vegita. The reason is hiding inside your question, highlighted above.
In a must be true question, in order to eliminate an answer choice, we are not required to show that it's impossible for the answer choice to work. Rather, we need only show that the answer choice *might* not work. In this case, we have to show that n(n+2)(n-1) *might* not be a multiple of 3.
You can go through all the possibilities (which I'll show below), and see that n(n+2)(n-1) isn't necessarily a multiple of 3. In the video I explain how I could tell that this is the case without having to do all the extra work.
If n has a remainder of zero in the world of divisibility by 3:
n(n+2)(n-1) is a multiple of 3 (thanks to n)
If n has a remainder of 1 in the world of divisibility by 3:
n(n+2)(n-1) is a multiple of 3 (in fact, it's a multiple of 9) thanks to (n+2) and (n-1)
If n has a remainder of 2 in the world of divisibility by 3:
(n+2)(n-1) is NOT a multiple of 3.
avatar
Deepam10
Joined: 29 Nov 2023
Last visit: 02 Mar 2024
Posts: 5
Own Kudos:
Given Kudos: 62
Concentration: General Management, Strategy
Posts: 5
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
gregspirited
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)

Since 3 is a prime number then in order the product to be divisible by 3 either of the multiples must be divisible by 3. Now, to guarantee that at least one multiple is divisible by 3, these numbers must have different remainders upon division by 3, meaning that one of them should have the remainder of 1, another the reminder of 2 and the third one the remainder of 0, so be divisible by 3.

For option A: n and n+1 have different remainder upon division by 3. As for n-4, it will have the same remainder as (n-4)+3=n-1, so also different than the remainders of the previous two numbers.

Answer: A.

Similar question to practice: https://gmatclub.com/forum/if-x-is-an-i ... 26853.html

Hope it helps.


Unfortunately, I am finding it hard to understand why plugging in values don't work in this question. If n=20, (given n>6), option c also works since it gives
C. n (n+3) (n-5)
20 (23)(15) where 15 is divi by 3. Could you please explain why plugging in values doesn't work and if it does, how to choose value of n so that only option A works and no other option works Bunuel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
Given Kudos: 99,964
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,092
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Deepam10
Bunuel
gregspirited
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)

Since 3 is a prime number then in order the product to be divisible by 3 either of the multiples must be divisible by 3. Now, to guarantee that at least one multiple is divisible by 3, these numbers must have different remainders upon division by 3, meaning that one of them should have the remainder of 1, another the reminder of 2 and the third one the remainder of 0, so be divisible by 3.

For option A: n and n+1 have different remainder upon division by 3. As for n-4, it will have the same remainder as (n-4)+3=n-1, so also different than the remainders of the previous two numbers.

Answer: A.

Similar question to practice: https://gmatclub.com/forum/if-x-is-an-i ... 26853.html

Hope it helps.


Unfortunately, I am finding it hard to understand why plugging in values don't work in this question. If n=20, (given n>6), option c also works since it gives
C. n (n+3) (n-5)
20 (23)(15) where 15 is divi by 3. Could you please explain why plugging in values doesn't work and if it does, how to choose value of n so that only option A works and no other option works Bunuel

Observe that the question asks 'which of the following must be divisible by 3?', not 'could be divisible by 3'. While all options could potentially be divisible by 3 for specific values of n, only option A guarantees divisibility by 3 for all values of n. Hence, only option A must be divisible y 3.

You can practice more questions of 'Must/Could be true' type HERE.

Hope it helps.
User avatar
egmat
User avatar
e-GMAT Representative
Joined: 02 Nov 2011
Last visit: 18 Nov 2025
Posts: 5,108
Own Kudos:
32,884
 [1]
Given Kudos: 700
GMAT Date: 08-19-2020
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 5,108
Kudos: 32,884
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
This is a classic divisibility question that tests your understanding of number properties. The key is recognizing which expression guarantees divisibility by 3 for ALL valid values of n, not just some.

Solution Approach:

Step 1: Understand the requirement
We need an expression that is ALWAYS divisible by 3 when \(n > 6\). Remember: a product is divisible by 3 if at least one of its factors is divisible by 3.

Step 2: Test strategically with different values
Let's test with \(n = 7\) and \(n = 8\) to see which expressions consistently work:

For \(n = 7\):
A. \(n(n+1)(n-4) = 7 \times 8 \times 3 = 168\) → divisible by 3 ✓
B. \(n(n+2)(n-1) = 7 \times 9 \times 6 = 378\) → divisible by 3 ✓
C. \(n(n+3)(n-5) = 7 \times 10 \times 2 = 140\) → NOT divisible by 3 ✗
D. \(n(n+4)(n-2) = 7 \times 11 \times 5 = 385\) → NOT divisible by 3 ✗
E. \(n(n+5)(n-6) = 7 \times 12 \times 1 = 84\) → divisible by 3 ✓

For \(n = 8\):
A. \(n(n+1)(n-4) = 8 \times 9 \times 4 = 288\) → divisible by 3 ✓
B. \(n(n+2)(n-1) = 8 \times 10 \times 7 = 560\) → NOT divisible by 3 ✗
E. \(n(n+5)(n-6) = 8 \times 13 \times 2 = 208\) → NOT divisible by 3 ✗

Step 3: Recognize the pattern in Choice A
Choice A has factors \((n-4), n, (n+1)\). Here's the key insight: when you look at these three numbers within a span of consecutive integers, you're guaranteed to hit at least one multiple of 3.

Think about it: in the sequence \( (n-4), (n-3), (n-2), (n-1), n, (n+1) \), we have 6 consecutive integers. Among any 6 consecutive integers, exactly two must be divisible by 3. Since we're picking three specific positions from this sequence, we're guaranteed that at least one of our chosen factors will be divisible by 3.

Answer: A

For a comprehensive understanding of divisibility patterns and alternative solution methods that save time on test day, check out the detailed solution on Neuron by e-GMAT. You'll learn the systematic framework that applies to all divisibility questions, plus discover why certain number property patterns repeat across GMAT problems. Access structured solutions for official questions on Neuron.
User avatar
egmat
User avatar
e-GMAT Representative
Joined: 02 Nov 2011
Last visit: 18 Nov 2025
Posts: 5,108
Own Kudos:
Given Kudos: 700
GMAT Date: 08-19-2020
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 5,108
Kudos: 32,884
Kudos
Add Kudos
Bookmarks
Bookmark this Post
This is a classic divisibility problem that tests whether you can identify patterns in products of expressions. The keyword here is "must" – meaning the expression has to be divisible by 3 for every integer \(n > 6\), not just some values.

Here's how you can think through this:

Step 1: Understand what makes a product divisible by 3

When you're multiplying several numbers together, the entire product is divisible by 3 if at least one of those numbers is divisible by 3. For example, \(4 \times 7 \times 9 = 252\), which is divisible by 3 because 9 is divisible by 3. This is your key insight for this problem.

Step 2: Test systematically with specific values

Let's test each choice with \(n = 7\) and \(n = 8\) to eliminate wrong answers:

Choice A: \(n(n+1)(n-4)\)
  • When \(n = 7\): \(7 \times 8 \times 3 = 168\) → \(168 \div 3 = 56\) ✓
  • When \(n = 8\): \(8 \times 9 \times 4 = 288\) → \(288 \div 3 = 96\) ✓

Choice B: \(n(n+2)(n-1)\)
  • When \(n = 7\): \(7 \times 9 \times 6 = 378\) → \(378 \div 3 = 126\) ✓
  • When \(n = 8\): \(8 \times 10 \times 7 = 560\) → \(560 \div 3 = 186.67\)... ✗

Notice how Choice B fails for \(n = 8\)! This immediately eliminates it. If you continue testing the other choices with multiple values, you'll find they also fail for certain values of n.

Step 3: Understand why Choice A always works

Look at the three factors in Choice A: \((n-4)\), \(n\), and \((n+1)\).

These three numbers span across 6 consecutive integers: \((n-4), (n-3), (n-2), (n-1), n, (n+1)\). Here's the beautiful pattern: among any 6 consecutive integers, exactly two must be divisible by 3 (since every third integer is divisible by 3). Therefore, among our three chosen factors \((n-4)\), \(n\), and \((n+1)\), at least one must be divisible by 3, regardless of what n is.

Answer: A

Want to master this systematically? The approach I showed you works, but there's actually a more elegant way to see the pattern without testing multiple values. You can check out the complete framework on Neuron by e-GMAT that shows you how to identify divisibility patterns instantly and avoid common traps like confusing "must be" with "could be" divisible. You can also practice with detailed solutions for other official questions on Neuron to build systematic accuracy on number properties questions.
   1   2 
Moderators:
Math Expert
105355 posts
Tuck School Moderator
805 posts