Last visit was: 23 Apr 2026, 09:05 It is currently 23 Apr 2026, 09:05
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
OmkarSheth008
Joined: 03 Jan 2023
Last visit: 12 Dec 2023
Posts: 4
Own Kudos:
6
 [2]
Given Kudos: 18
GMAT 1: 610 Q36 V38
GMAT 1: 610 Q36 V38
Posts: 4
Kudos: 6
 [2]
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
gmatophobia
User avatar
Quant Chat Moderator
Joined: 22 Dec 2016
Last visit: 19 Apr 2026
Posts: 3,173
Own Kudos:
Given Kudos: 1,862
Location: India
Concentration: Strategy, Leadership
Posts: 3,173
Kudos: 11,454
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
HarshaBujji
Joined: 29 Jun 2020
Last visit: 23 Apr 2026
Posts: 723
Own Kudos:
Given Kudos: 247
Location: India
Products:
Posts: 723
Kudos: 906
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Crater
Joined: 14 May 2023
Last visit: 26 Nov 2024
Posts: 53
Own Kudos:
78
 [1]
Given Kudos: 9
Location: India
Posts: 53
Kudos: 78
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
gmatophobia

(1) For any positive integer y, the product of all integers from y to y+n is divisible by 35.

35 = 7 * 5

Hence, if we take any set of 7 consecutive integers, the product will be divisible by 35.

Therefore, the minimum value of 'n' is 6. Any value of n greater than or equal to 6 satisfies statement 1.

Hence, the statement alone is not sufficient to find a unique value of n. We can eliminate A and D.
If y=2, n=5, y+n=7
2*3*4*5*6*7 is divisible by 35.

What am I doing wrong here?
User avatar
Akshay97
Joined: 12 Mar 2023
Last visit: 21 Jan 2026
Posts: 3
Own Kudos:
Given Kudos: 43
Location: India
GMAT Focus 1: 645 Q84 V82 DI80
GMAT 1: 730 Q49 V41
GMAT 2: 700 Q47 V39
GPA: 3.3
WE:Operations (Transportation)
GMAT Focus 1: 645 Q84 V82 DI80
GMAT 2: 700 Q47 V39
Posts: 3
Kudos: 8
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Crater
gmatophobia

(1) For any positive integer y, the product of all integers from y to y+n is divisible by 35.

35 = 7 * 5

Hence, if we take any set of 7 consecutive integers, the product will be divisible by 35.

Therefore, the minimum value of 'n' is 6. Any value of n greater than or equal to 6 satisfies statement 1.

Hence, the statement alone is not sufficient to find a unique value of n. We can eliminate A and D.
If y=2, n=5, y+n=7
2*3*4*5*6*7 is divisible by 35.

What am I doing wrong here?

Nothing, Question is either vague or poorly worded.
For all we know, y can also be 35.
Moderators:
Math Expert
109779 posts
498 posts
212 posts