Last visit was: 23 Apr 2026, 03:21 It is currently 23 Apr 2026, 03:21
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
bambinobirbante
Joined: 09 Apr 2017
Last visit: 27 May 2023
Posts: 31
Own Kudos:
17
 [6]
Given Kudos: 48
Location: India
Schools: HBS '26
Schools: HBS '26
Posts: 31
Kudos: 17
 [6]
1
Kudos
Add Kudos
5
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,453
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
SaquibHGMATWhiz
User avatar
GMATWhiz Representative
Joined: 23 May 2022
Last visit: 12 Jun 2024
Posts: 623
Own Kudos:
Given Kudos: 6
Location: India
GMAT 1: 760 Q51 V40
Expert
Expert reply
GMAT 1: 760 Q51 V40
Posts: 623
Kudos: 777
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
luisdicampo
Joined: 10 Feb 2025
Last visit: 19 Apr 2026
Posts: 480
Own Kudos:
Given Kudos: 328
Products:
Posts: 480
Kudos: 73
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Deconstructing the Question

Let the 7 positive integers in increasing order be \(a_1<a_2<a_3<a_4<a_5<a_6<a_7\).

We need the value of the smallest integer, which is \(a_1\).

Statement (1) gives the largest term.
Statement (2) gives the minimum gap between consecutive terms.

The key is to check whether these conditions force a unique value for \(a_1\).

Step-by-step

Statement (1): The highest term in the set is \(37\).

So \(a_7=37\).

This alone is not enough. The smallest term could vary.

Statement (1): Insufficient

Statement (2): The difference between any two consecutive terms is at least \(6\).

So each gap satisfies

\(a_2-a_1\ge 6,\ a_3-a_2\ge 6,\ \dots,\ a_7-a_6\ge 6\)

But there is no fixed largest or smallest value, so the smallest term can vary.

Statement (2): Insufficient

Now combine the statements.

We know \(a_7=37\), and there are \(6\) gaps between the \(7\) numbers.

Since each gap is at least \(6\), the total difference between largest and smallest is at least

\(6\cdot 6=36\)

So

\(a_7-a_1\ge 36\)

Substitute \(a_7=37\):

\(37-a_1\ge 36\)

Thus

\(a_1\le 1\)

But all integers are positive, so

\(a_1\ge 1\)

Therefore,

\(a_1=1\)

Final Answer: C
Moderators:
Math Expert
109773 posts
498 posts
212 posts