Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Suppose n + 1 numbers are chosen from the integers {1, 2, . . . , 2n}. Prove that there exists two of these numbers that sum to 2n + 1

Miracrown (miracrown):

We need to use the Pigeon hole principle.

OpenStudy (dan815):

whats that?

Miracrown (miracrown):

Have you neva heard of it b4

OpenStudy (dan815):

|dw:1418624915951:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!