Given any set of 15 integers, must there be two that have the same remainder when divided by 12? Write an answer that would convince a good but skeptical fellow student who has learned the statement of the pigeonhole principle but not seen an application like this one. Either describe the pigeons, the pigeonholes, and how the pigeons get to the pigeonholes, or describe a function by giving its domain, co-domain, and how elements of the domain are related to elements of the co-domain
Ths question was already asked on this platform, but it doesn't really have an answer that is understandable and clear. Can someone please explain this in a way that is more understandable? That I could use with other values? Thanks
Given any set of 15 integers, must there be two that have the same remainder when divided
by 12? Write an answer that would convince a good but skeptical fellow student who has
learned the statement of the pigeonhole principle but not seen an application like this one.
Either describe the pigeons, the pigeonholes, and how the pigeons get to the pigeonholes,
or describe a function by giving its domain, co-domain, and how elements of the domain are
related to elements of the co-domain
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
