Hey there! This is a classic divisibility question that trips up a lot of students, but once you see the pattern, it becomes quite manageable.
Let's think about this step by step. We need to find when \(n(n+1)\) is divisible by 3, where n is any integer from 1 to 99.
Here's the key insight: For a product to be divisible by 3, at least one of its factors must be divisible by 3. So either n or (n+1) needs to be divisible by 3.
Step 1: Think in terms of remaindersWhen you divide any integer by 3, you can only get three possible remainders: 0, 1, or 2. Every integer falls into exactly one of these categories.
Step 2: Test each remainder caseCase 1: n gives remainder 0 when divided by 3
This means n is divisible by 3 (like n = 3, 6, 9, 12...)
Since n is already divisible by 3, then \(n(n+1)\) will definitely be divisible by 3.
✓ This case works!
Case 2: n gives remainder 1 when divided by 3
Examples: n = 1, 4, 7, 10...
Then n + 1 gives remainder 2 when divided by 3.
So neither n nor (n+1) is divisible by 3, which means \(n(n+1)\) is not divisible by 3.
✗ This case doesn't work.
Case 3: n gives remainder 2 when divided by 3
Examples: n = 2, 5, 8, 11...
Then n + 1 gives remainder 0 when divided by 3, so (n+1) is divisible by 3!
Since (n+1) is divisible by 3, then \(n(n+1)\) will be divisible by 3.
✓ This case works!
Step 3: Count the favorable outcomesFrom our analysis: Cases 1 and 3 work, but Case 2 doesn't.
So 2 out of 3 cases work.
Since integers are evenly distributed among these three remainder classes, the probability is:
\(\frac{2}{3}\)
Answer: D) 2/3You can verify this with examples: n=1 gives 1×2=2 (not divisible by 3), n=2 gives 2×3=6 (divisible by 3), n=3 gives 3×4=12 (divisible by 3), and so on.
For the complete systematic framework that applies to all consecutive integer divisibility problems, along with alternative solution methods and common trap patterns to avoid, you can check out the
detailed explanation on Neuron. You can also practice with comprehensive solutions for
other official questions on Neuron to build pattern recognition for similar probability and divisibility questions.