Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 1612:00 PM EDT
-11:59 PM EDT
You’re first to know: Save $200 on GMAT prep starting tomorrow, 4/13. Get 6 official practice tests and study with real questions. Be ready to save!
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
HK12!
Joined: 04 Jul 2023
Last visit: 18 Apr 2026
Posts: 59
Own Kudos:
Given Kudos: 35
Location: India
Concentration: Entrepreneurship, Sustainability
Schools: INSEAD MiM '26 HEC ESSEC MiM '26 MiM '26 Kellogg MiM '26
GMAT Focus 1: 515 Q81 V75 DI70 
GMAT 1: 370 Q31 V12
GPA: 3.2/4
WE:Marketing (Real Estate)
Products:
Schools: INSEAD MiM '26 HEC ESSEC MiM '26 MiM '26 Kellogg MiM '26
GMAT Focus 1: 515 Q81 V75 DI70
GMAT 1: 370 Q31 V12
Posts: 59
Kudos:
21
05 Jul 2025, 08:46
Kudos
Bookmarks
For p: Probability that n(n+1) divisible by 5
- n(n+1) is divisible by 5 if either n or n+1divisible by 5
- So n≡0 mod 5 or n≡4 mod 5
- Each case gives 120 values → total favorable outcomes = 240
- p=240/600=2/5
- n(n−1)divisible by 25 if either n or n−1divisible by 25
- So n≡0 mod 25 or n≡1 mod 25
- Each case gives 24 values → total favorable outcomes = 48
- q=48/600=2/25
Bunuel
Mrinalsingh13
Joined: 30 May 2020
Last visit: 15 Mar 2026
Posts: 14
Own Kudos:
Given Kudos: 48
Location: India
Schools: Kellogg '26 (II) LBS '26 (S)
GMAT 1: 750 Q50 V41
GPA: 7.17
20 Jul 2025, 09:24
Kudos
Bookmarks
Can anyone explain how q = 2/25?
If n(n-1) is divisible by 25, then that means either n or n-1 is divisible by 25.
if n is divisible by 25 -> then there are 24 such numbers.
If n-1 is divisible 25 -> 26, 51, 76, and so on -> 26 + 25x <= 600.
Solving for this we get x <= 22. Including initial 26 as well -> total n-1 numbers divisible by 25 = 23.
So total numbers becomes 47 and not 48.
If n(n-1) is divisible by 25, then that means either n or n-1 is divisible by 25.
if n is divisible by 25 -> then there are 24 such numbers.
If n-1 is divisible 25 -> 26, 51, 76, and so on -> 26 + 25x <= 600.
Solving for this we get x <= 22. Including initial 26 as well -> total n-1 numbers divisible by 25 = 23.
So total numbers becomes 47 and not 48.
21 Jul 2025, 21:22
Kudos
Bookmarks
you still need to include n=1 because 0 is divisible by 25. This will give you the needed two solutions in every set of 25.
Mrinalsingh13
