Here, we're dealing with factorial notation and checking for primes in a specific range. But there's actually a really elegant pattern here that makes this much simpler than manually checking each number. Let me walk you through it.
Here's how to approach this:Step 1: Calculate the factorial and identify your rangeFirst, let's figure out what we're working with. The notation \(6!\) means \(6\) factorial, which is:
\(6! = 1 \times 2 \times 3 \times 4 \times 5 \times 6 = 720\)
So you need to find prime numbers between:
- \(6! + 2 = 720 + 2 = 722\)
- \(6! + 6 = 720 + 6 = 726\)
That gives you five numbers to check: \(722, 723, 724, 725, 726\)
Step 2: Recognize the key pattern (this is the insight that changes everything)Here's what you need to see: Since \(6!\) is the product \(1 \times 2 \times 3 \times 4 \times 5 \times 6\), it contains all these numbers as factors. This means:
- \(6!\) is divisible by 2
- \(6!\) is divisible by 3
- \(6!\) is divisible by 4
- \(6!\) is divisible by 5
- \(6!\) is divisible by 6
Now here's the crucial part: When you add one of these factors back to \(6!\), you can factor it out!
Step 3: Apply the divisibility patternLet's see this in action:
\(6! + 2 = 722\)
Since \(6!\) is divisible by 2, we can write \(6! = 2k\) where \(k = 360\)
So \(6! + 2 = 2k + 2 = 2(k + 1) = 2(361)\)
Therefore, 722 is divisible by 2 →
not prime\(6! + 3 = 723\)
Since \(6!\) is divisible by 3: \(6! + 3 = 3(240 + 1) = 3(241)\)
Therefore, 723 is divisible by 3 →
not prime\(6! + 4 = 724\)
Since \(6!\) is divisible by 4: \(6! + 4 = 4(180 + 1) = 4(181)\)
Therefore, 724 is divisible by 4 →
not prime\(6! + 5 = 725\)
Since \(6!\) is divisible by 5: \(6! + 5 = 5(144 + 1) = 5(145)\)
Therefore, 725 is divisible by 5 →
not prime\(6! + 6 = 726\)
Since \(6!\) is divisible by 6: \(6! + 6 = 6(120 + 1) = 6(121)\)
Therefore, 726 is divisible by 6 →
not primeStep 4: Count the primesEvery single number in the range has an obvious factor greater than 1, which means none of them are prime.
Answer: (A) None---
The pattern I showed you here – that \(n! + k\) is divisible by \(k\) when \(k \leq n\) – is incredibly powerful for factorial problems. But there's more to learn about when this pattern applies, how to extend it to similar problems, and what variations you might encounter on the GMAT. You can check out the
complete framework and systematic approach on Neuron by e-GMAT to understand how to recognize and apply these factorial divisibility patterns across different question types. You can also explore detailed solutions for
other GMAT official questions here to build your pattern recognition skills systematically.
Hope this helps you see the elegant shortcut! Let me know if you have questions.