Hey there! I see you're working on this divisibility problem – these can be tricky because they require you to think about the relationship between \(b\) and \(b^4\). Let me walk you through how to approach this systematically.
Here's the key insight you need:When we're told that \(b^4\) is divisible by 81, let's first think about what 81 really is. Notice that \(81 = 3^4\). This is crucial because it tells us something important about \(b\) itself.
Step 1: Understanding the constraint on bThink about this: if \(b^4\) must be divisible by \(3^4\), then \(b^4\) needs to have at least four factors of 3.
Now, if \(b\) has \(n\) factors of 3, then \(b^4\) will have \(4n\) factors of 3 (because we're multiplying \(b\) by itself 4 times). For \(b^4\) to be divisible by \(3^4\), we need:
\(4n \geq 4\)
This means \(n \geq 1\)
So \(b\) must have at least one factor of 3 – in other words, \(b\) must be divisible by 3!
Step 2: Finding possible remaindersSince \(b\) must be a multiple of 3, let's check what remainders are possible when we divide multiples of 3 by 9:
- \(3 \div 9\) gives remainder 3
- \(6 \div 9\) gives remainder 6
- \(9 \div 9\) gives remainder 0
- \(12 \div 9\) gives remainder 3
- \(15 \div 9\) gives remainder 6
- \(18 \div 9\) gives remainder 0
Notice the pattern? Multiples of 3, when divided by 9, can only have remainders of 0, 3, or 6.
Step 3: Check the answer choicesLooking at our options (1, 2, 4, 6, 8), only
6 is among the possible remainders we found.
Let's verify with \(b = 6\): We get \(b^4 = 1296 = 81 \times 16\) ✓
Answer: D (6)---
You can check out the
step-by-step solution on Neuron by e-GMAT to master the systematic framework for all divisibility problems involving powers. The full solution shows you alternative approaches and a powerful pattern that applies to similar GMAT questions. You can also explore other GMAT official questions with detailed solutions on Neuron for structured practice
here.