Proof using piegeonhole principle

Question

how can I prove that In every collection of 51 integers between 1 and 100 there are at least two whose sum is 101.

I could't come upwith a solution please help

try to include thoughts and attempts in your future posts. – Siong Thye Goh Dec 01 '17 at 06:30 — Siong Thye Goh, Dec 01 '17 at 06:30
See the pigeonhole principle – eepperly16 Dec 01 '17 at 06:51 — eepperly16, Dec 01 '17 at 06:51

score 2 · Answer 1 · answered Dec 01 '17 at 06:26

2

Hint: How many pairs of positive integers are there that add up to 101?

answered Dec 01 '17 at 06:26

Isaac Browne

1 Answers1