Question

Let s={3,4,5,6,7,8,9,10,11,12}. How many integers must be chosen from s, such that there exists two integers whose sum is 15?

Answer 1

Answer:

Follow me

Step-by-step explanation:

onsider the following given set:

How can I go about solving this Pigeonhole Principle problem?

So I think the possible numbers would be: [3+12],[4+11],[5+10],[6+9],[7+8]

I am trying to put this in words..

Answer 2

Answer:

from s 2 integers must be choosen

Step-by-step explanation:

12 and 3 i.e

12+3=15