Last visit was: 18 Nov 2025, 15:53 It is currently 18 Nov 2025, 15:53
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
HarshaBujji
Joined: 29 Jun 2020
Last visit: 16 Nov 2025
Posts: 695
Own Kudos:
885
 [9]
Given Kudos: 247
Location: India
Products:
Posts: 695
Kudos: 885
 [9]
1
Kudos
Add Kudos
8
Bookmarks
Bookmark this Post
User avatar
bishwanathmishra
Joined: 26 Apr 2020
Last visit: 18 Mar 2025
Posts: 1
Own Kudos:
7
 [1]
Given Kudos: 1
Posts: 1
Kudos: 7
 [1]
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
arunkumar1975
Joined: 25 Feb 2020
Last visit: 03 Oct 2025
Posts: 13
Own Kudos:
19
 [1]
Given Kudos: 5
Posts: 13
Kudos: 19
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
Krunaal
User avatar
Tuck School Moderator
Joined: 15 Feb 2021
Last visit: 17 Nov 2025
Posts: 805
Own Kudos:
850
 [1]
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:
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If there are 5 consecutive integers, we will need at least two multiples of 3 or one multiple of 9 in their product for their product to be divisible by 9.

At least two multiples of 3

For n*(n+1)*(n+2)*(n+3)*(n+4) to have at least two multiples of 3, we can see that if n is a multiple of 3, we will get two multiples of 3 in the product because we have n and (n+3). So, all the multiples of 3 are valid.

90 = 3 + (k - 1)*3
k = 30

Also, every number before the multiple of 3 will be valid because we have (n+1) and (n+4)

89 = 2 + (l - 1)*3
l = 30

After considering the numbers in the above two cases, the only numbers left are 4, 7, 10, 13, 16,........, 85, 88.

One multiple of 9

Now, since we know that the only numbers left to be considered are 4, 7, 10, 13, 16,........, 85, 88. We can get one multiple of 9 in n*(n+1)*(n+2)*(n+3)*(n+4) when we consider 7, 16, 25,...., 79, 88 because we have (n+2).

88 = 7 + (m-1)*9
m = 10

Probability

Total integers = 90
No. of integers where n*(n + 1)*(n + 2)*(n+3)*(n+4) will be divisible by 9 = k + l + m = 70

=> 70/90 = 7/9 = 21/27

Answer C.
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 18 Nov 2025
Posts: 5,793
Own Kudos:
Given Kudos: 161
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,793
Kudos: 5,508
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If an integer n is to be chosen at random from the integers 1 to 90, inclusive, what is the probability that n(n + 1)(n + 2)(n+3)(n+4) will be divisible by 9?

In general, n is either of the forms 9k, 9k+1, 9k+2, 9k+3, 9k+4, 9k-1 , 9k-2, 9k-3 , 9k-4
n=9k; n(n + 1)(n + 2)(n+3)(n+4) = 9k(9k+1)(9k+2)(9k+3)(9k+4) divisible by 9
n=9k+1; n(n + 1)(n + 2)(n+3)(n+4) = (9k+1)(9k+2)(9k+3)(9k+4)(9k+5) not divisible by 9;
n=9k+2; n(n + 1)(n + 2)(n+3)(n+4) = (9k+2)(9k+3)(9k+4)(9k+5)(9k+6) divisible by 9
n=9k+3; n(n + 1)(n + 2)(n+3)(n+4) = (9k+3)(9k+4)(9k+5)(9k+6)(9k+7) divisible by 9
n=9k+4; n(n + 1)(n + 2)(n+3)(n+4) = (9k+4)(9k+5)(9k+6)(9k+7)(9k+8) not divisible by 9

n=9k-1; n(n + 1)(n + 2)(n+3)(n+4) = (9k-1)9k(9k+1)(9k+2)(9k+3) divisible by 9
n=9k-2; n(n + 1)(n + 2)(n+3)(n+4) = (9k-2)(9k-1)9k(9k+1)(9k+2) divisible by 9

n=9k-3; n(n + 1)(n + 2)(n+3)(n+4) = (9k-3)(9k-2)(9k-1)9k(9k+1) divisible by 9
n=9k+2; n(n + 1)(n + 2)(n+3)(n+4) = (9k-4)(9k-3)(9k-2)(9k-1)9k divisible by 9

In one set set of 9 numbers, 7 are divisible by 9.

Number of such sets = 90/9 = 10

If an integer n is to be chosen at random from the integers 1 to 90, inclusive, the probability that n(n + 1)(n + 2)(n+3)(n+4) will be divisible by 9 = 7/9 = 21/27

IMO C
User avatar
AditiMonga21
Joined: 15 Dec 2024
Last visit: 24 Feb 2025
Posts: 2
Given Kudos: 2
Posts: 2
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
not favorable outcomes are of the 3k+1, but of the form 9k-2

Total outcomes are 90 (1 to 90, inclusive)
Numbers of form 3k+1 = 30 (from k=0 to 29, inclusive)
Numbers of the form 9k-2 = 10 (from k=1 to 10, inclusive)

P = fav outcomes/total outcomes = (90-30+10)/90 = 70/90 = 7/9 = 21/27
Answer is option c
Moderators:
Math Expert
105355 posts
Tuck School Moderator
805 posts