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 3When 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 valuesLet'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 worksLook 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: AWant 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.