Last visit was: 26 Apr 2026, 04:23 It is currently 26 Apr 2026, 04:23
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
Ravixxx
Joined: 24 Feb 2020
Last visit: 11 Feb 2026
Posts: 116
Own Kudos:
774
 [7]
Given Kudos: 118
Location: Italy
WE:Analyst (Finance: Investment Banking)
Posts: 116
Kudos: 774
 [7]
Kudos
Add Kudos
7
Bookmarks
Bookmark this Post
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 12 Mar 2026
Posts: 1,841
Own Kudos:
8,511
 [1]
Given Kudos: 707
Location: India
Posts: 1,841
Kudos: 8,511
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
tanpopo145
Joined: 07 Oct 2016
Last visit: 03 Nov 2021
Posts: 4
Own Kudos:
7
 [1]
Given Kudos: 3
Posts: 4
Kudos: 7
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 12 Mar 2026
Posts: 1,841
Own Kudos:
8,511
 [3]
Given Kudos: 707
Location: India
Posts: 1,841
Kudos: 8,511
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
This question is based on Pigeonhole principle. If you put n+1 items in n containers, then at least one container have more than 1 item(Simple right)

If you want to choose a set in which sum of two of numbers is equal to 25, then you must include at least one pair (you mentioned 8 of those)in your set. So you have to choose 9 out of these 16 numbers in order to guarantee that at least one of the 8 pairs must have chosen.

Total minimum integers you gotta choose = 9+4(remaining ones 1,2,3 and 4) = 13




tanpopo145
I am quite confused. Could you please help to elaborate more?

I have these sets: 20+5,19+6,18+7,17+8,16+9,15+10,14+11,13+12 --> total 16 distinct integers?
User avatar
Shrey08
Joined: 04 Mar 2020
Last visit: 04 Mar 2026
Posts: 171
Own Kudos:
182
 [1]
Given Kudos: 312
Location: India
GMAT 1: 640 Q47 V30
GMAT 1: 640 Q47 V30
Posts: 171
Kudos: 182
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nick1816
This question is based on Pigeonhole principle. If you put n+1 items in n containers, then at least one container have more than 1 item(Simple right)

If you want to choose a set in which sum of two of numbers is equal to 25, then you must include at least one pair (you mentioned 8 of those)in your set. So you have to choose 9 out of these 16 numbers in order to guarantee that at least one of the 8 pairs must have chosen.

Total minimum integers you gotta choose = 9+4(remaining ones 1,2,3 and 4) = 13




tanpopo145
I am quite confused. Could you please help to elaborate more?

I have these sets: 20+5,19+6,18+7,17+8,16+9,15+10,14+11,13+12 --> total 16 distinct integers?

Hello,

Why are we considering (1,2,3, and 4) when these numbers will never, along with any other integer in the set, yield a sum 25?
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 26 Apr 2026
Posts: 6,977
Own Kudos:
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,977
Kudos: 16,921
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ShreyKapil08
nick1816
This question is based on Pigeonhole principle. If you put n+1 items in n containers, then at least one container have more than 1 item(Simple right)

If you want to choose a set in which sum of two of numbers is equal to 25, then you must include at least one pair (you mentioned 8 of those)in your set. So you have to choose 9 out of these 16 numbers in order to guarantee that at least one of the 8 pairs must have chosen.

Total minimum integers you gotta choose = 9+4(remaining ones 1,2,3 and 4) = 13




tanpopo145
I am quite confused. Could you please help to elaborate more?

I have these sets: 20+5,19+6,18+7,17+8,16+9,15+10,14+11,13+12 --> total 16 distinct integers?

Hello,

Why are we considering (1,2,3, and 4) when these numbers will never, along with any other integer in the set, yield a sum 25?

The set of numbers available is {1, 2, ...., 20}

i.e. Biggest number in the set is 20

which requires 5 to make sum = 25 [20+5 = 25]

therefore {1, 2, 3, 4} can NOT pair with any other number in set to make the sum = 25


Now, look at it this way
- If we choose {1, 2, 3, 4} the sum can NOT be 25
- If we choose half of the 16 numbers (one of each pair that makes sum = 25) even then no two terms will add up to 25
- therefore even after choosing 4+8 = 12 terms the sum is not becoming 25
- But if we choose one more term from remaining 8 numbers then the chosen number will definitely make a pair with another previously chosen number to give sum = 25

i.e. total Numbers needed to choose to ensure that sum 25 is 4+8+1 = 13 numbers


ShreyKapil08
User avatar
yashikaaggarwal
User avatar
Senior Moderator - Masters Forum
Joined: 19 Jan 2020
Last visit: 29 Mar 2026
Posts: 3,088
Own Kudos:
Given Kudos: 1,510
Location: India
GPA: 4
WE:Analyst (Internet and New Media)
Kudos
Add Kudos
Bookmarks
Bookmark this Post
[quote="nick1816"]This question is based on Pigeonhole principle. If you put n+1 items in n containers, then at least one container have more than 1 item(Simple right)

If you want to choose a set in which sum of two of numbers is equal to 25, then you must include at least one pair (you mentioned 8 of those)in your set. So you have to choose 9 out of these 16 numbers in order to guarantee that at least one of the 8 pairs must have chosen.

Total minimum integers you gotta choose = 9+4(remaining ones 1,2,3 and 4) = 13




[quote="tanpopo145"]I am quite confused. Could you please help to elaborate more?

I have these sets: 20+5,19+6,18+7,17+8,16+9,15+10,14+11,13+12 --> total 16 distinct integers?[/quote][/quote]

Could you briefly explain what's this pigeon hole principle. Moreover why you took 1 to 4 digits as distinct factors of Y. When they don't form 25 with the highest value given in set

[size=80][b][i]Posted from my mobile device[/i][/b][/size]
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 12 Mar 2026
Posts: 1,841
Own Kudos:
8,511
 [1]
Given Kudos: 707
Location: India
Posts: 1,841
Kudos: 8,511
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
yashikaaggarwal ShreyKapil08

Let's change this question to ' How many maximum numbers we can choose from the set, so that sum of any 2 numbers is not equal to 25.

We will take the worst possible scenario, since we have to maximize the numbers in subset. Choose 1, 2, 3, 4 and one number out of each of the 8 pairs whose sum is equal to 25. In this scenario, sum of any 2 numbers can never be equal to 25.

One of such possible case-

S = {1,2,3,4,5,6,7,8,9,10,11,12}

20+5,19+6,18+7,17+8,16+9,15+10,14+11,13+12. I choose the highlighted one in my subset.

But now if i add any of the remaining 8 numbers in my subset, sum of 1 pair must be equal to 25. For Example if i add 13 in subset S , then 12+13 =25 or if i add 14, then 11+14=25 and so on.

Hence, by choosing (12+1) 13 numbers, we can guarantee that sum of at least 1 pair among chosen number is equal to 25.
User avatar
Kunni
Joined: 01 Sep 2019
Last visit: 07 Mar 2021
Posts: 29
Own Kudos:
Given Kudos: 32
Concentration: Marketing, Strategy
Posts: 29
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Ravixxx
How many distinct integers from the set \([1,2,3,..20]\) must be chosen to guarantee that two of them have a sum of 25?

(A) 12
(B) 13
(C) 14
(D) 15
(E) 16

Hi VeritasKarishma

Could you please help?

Regards
Kunal
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 23 Apr 2026
Posts: 16,441
Own Kudos:
Given Kudos: 485
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,441
Kudos: 79,414
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Kunni
Ravixxx
How many distinct integers from the set \([1,2,3,..20]\) must be chosen to guarantee that two of them have a sum of 25?

(A) 12
(B) 13
(C) 14
(D) 15
(E) 16

Hi VeritasKarishma

Could you please help?

Regards
Kunal

How can we get a sum of 25 using 2 numbers from the given set?

[1, 2, 3, 4, 5, 6, 7, ... 17, 18, 19, 20]

1 + 24 (not in set) so not possible
...
5 + 20 (the first possible pair)
6 + 19
...

12 + 13 (last possible pair without repeating)

So how many maximum numbers can I pick such that NO two of them will add to give me 25?
I can pick all numbers from 1 to 12 and still no two of them will add to give me 25. The greatest numbers are 11 and 12 which will add to give 23.

But the moment I pick one more number (any one), I will get a pair that will give be 25.
Say I pick 13, now 12 + 13 = 25.
Say I pick 15, now 10 + 15 = 25
and so on...

So if I pick 13 numbers there will always be a pair that will add to give me 25.

Answer (B)

Note: The question should mention "how many minimum numbers must we pick ..." because if we pick all 20 numbers then also we will have pairs that will give us 25.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,985
Own Kudos:
Posts: 38,985
Kudos: 1,118
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109832 posts
Tuck School Moderator
852 posts