There are houses on a street. Each house has an address between and , inclusive. Show that at least two houses have addresses that are consecutive integers.
Pigeon hole principle:
There are possible addresses and houses. In order for there to be no houses with consecutive addresses, each house must have at least one address in between it. This can be done by only assigning even numbers to houses (leaving odd addresses as the buffer address)
Assigning even numbers to houses (leaving odd addresses as the buffer address) We now have useable addresses.
By the pigeon hole principle, If objects are placed into boxes, then there is at least one box containing at least object.
Hence it can’t assigned unique addresses to different houses without using any one consecutive integer.
Hence, there must be at least one instance of houses having consecutive integers, meaning there are at least two houses that have addresses that are consecutive integers.