Proof using piegeonhole principle

56 Views Asked by At

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

1

There are 1 best solutions below

2
On

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