Last visit was: 19 Nov 2025, 23:07 It is currently 19 Nov 2025, 23:07
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
salopian
Joined: 12 Apr 2020
Last visit: 11 Apr 2021
Posts: 7
Own Kudos:
Given Kudos: 44
Posts: 7
Kudos: 7
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 77,001
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
GGGMAT2
Joined: 26 Oct 2024
Last visit: 09 Jun 2025
Posts: 68
Own Kudos:
Given Kudos: 153
Posts: 68
Kudos: 15
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Krunaal
User avatar
Tuck School Moderator
Joined: 15 Feb 2021
Last visit: 19 Nov 2025
Posts: 805
Own Kudos:
Given Kudos: 251
Status:Under the Square and Compass
Location: India
GMAT Focus 1: 755 Q90 V90 DI82
GPA: 5.78
WE:Marketing (Consulting)
Products:
Kudos
Add Kudos
Bookmarks
Bookmark this Post
GGGMAT2
We have to pick n from 1 to 99 inclusive, so the total number of sets of n(n+1) divisible by 3 should be 65, and not 66.

If we have to make such sets from 1 to 10, we get these sets {1,2}, {2,3}, {3,4}, {4,5}, {5,6}, {6,7}, {7,8}, {8,9}, {9,10}. Out of these - {2,3}, {3,4}, {5,6}, {6,7}, {8,9}, {9,10} are divisible by 3. So 6 out of 9.

But we need to stop at 99, so {99,100} will not be part of the list, so shouldn't the number of sets be 65 and not 66.

Bunuel ScottTargetTestPrep GMATBusters Please clarify.
{99, 100} => {n, n+1} will be a part since you have to pick n from 1 to 99, and not n+1.
User avatar
GGGMAT2
Joined: 26 Oct 2024
Last visit: 09 Jun 2025
Posts: 68
Own Kudos:
Given Kudos: 153
Posts: 68
Kudos: 15
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks, that helps!

Krunaal
GGGMAT2
We have to pick n from 1 to 99 inclusive, so the total number of sets of n(n+1) divisible by 3 should be 65, and not 66.

If we have to make such sets from 1 to 10, we get these sets {1,2}, {2,3}, {3,4}, {4,5}, {5,6}, {6,7}, {7,8}, {8,9}, {9,10}. Out of these - {2,3}, {3,4}, {5,6}, {6,7}, {8,9}, {9,10} are divisible by 3. So 6 out of 9.

But we need to stop at 99, so {99,100} will not be part of the list, so shouldn't the number of sets be 65 and not 66.

Bunuel ScottTargetTestPrep GMATBusters Please clarify.
{99, 100} => {n, n+1} will be a part since you have to pick n from 1 to 99, and not n+1.
User avatar
Slow_Yogi
Joined: 25 May 2024
Last visit: 19 Aug 2025
Posts: 13
Own Kudos:
Given Kudos: 21
Location: India
Posts: 13
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
My solution:-
take first 9 digits
out of this when n= 3 or 6 or 9, the given expression will be divisible by 3
Then, when n=2 0r 5 or 8, the given expression will be division by 3
Total= 6 out of 9 first digits are divisible by 3
so 6/9= 2/3 is the answer
User avatar
egmat
User avatar
e-GMAT Representative
Joined: 02 Nov 2011
Last visit: 19 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,887
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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 remainders
When 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 case

Case 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 outcomes
From 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/3

You 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.
User avatar
Kashu18
Joined: 20 Jul 2025
Last visit: 19 Nov 2025
Posts: 6
Given Kudos: 3
Posts: 6
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Can you please help with the additional step in the 2nd case?
Raihanuddin
In such problem always follow a simple rule.
The divisor is 3. So take number from 1 to 3 as example

If n=1, n(n+1)= Not divisible by 3
If n=2, n(n+1)= yes
If n=3, n(n+1)=yes. Don't need any more example.

So, 2 out of 3 are divisible. Hence, 2/3 is the answer.

This rule is applicable if last number(99 in this case) is divisible by 3.

If you had to pick from 1-98, still you can apply the rule but be careful. There is one more additional step.

Hopefully you can find answer now in less than 30 seconds
User avatar
GSV
Joined: 04 May 2024
Last visit: 19 Nov 2025
Posts: 9
Given Kudos: 88
Products:
Posts: 9
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
dheeraj24
Hi guys,
Could anyone tell whether my approach for this problem is correct.

Multiples of 3 between 1 and 99 are 33.
Multiples of (n+1) between 1 and 99 must also be 33.
Probability that [n(n+1)/3 ] is divisible by 3 is either n is divisible by 3 (or) (n+1) is divisible by 3 .
Probablity that n is divisible by 3 is 33/99 = 1/3;
Probabilty that n+1 is divisible by 3 is 33/99 = 1/3;
Therefore the probability that n(n+1)/3 is 1/3+ 1/3 = 2/3;
Thanks in advance :)
Yes, it seems right according to me.
   1   2 
Moderators:
Math Expert
105394 posts
Tuck School Moderator
805 posts