Pigeonhole principle: "If [imath]n+1[/imath] or more objects are placed into [imath]n[/imath] boxes, then at least one of the boxes contains two or more objects".
Proof. Suppose by contradiction that [imath]n[/imath] boxes contain exactly one object. Then [imath]n+1[/imath], [imath]n+2[/imath], ..., [imath]n+k[/imath] objects , with [imath]k\ge1[/imath] integer, must fill [imath]n+1[/imath], [imath]n+2[/imath], ..., [imath]n+k[/imath] boxes respectively. This contradicts the hypothesis that there are [imath]n[/imath] boxes."
Could this work?
Proof. Suppose by contradiction that [imath]n[/imath] boxes contain exactly one object. Then [imath]n+1[/imath], [imath]n+2[/imath], ..., [imath]n+k[/imath] objects , with [imath]k\ge1[/imath] integer, must fill [imath]n+1[/imath], [imath]n+2[/imath], ..., [imath]n+k[/imath] boxes respectively. This contradicts the hypothesis that there are [imath]n[/imath] boxes."
Could this work?