About this document
Pigeonhole Principle and Integer Sums by TrungNguyễnChí is a document available to read on EtoBox.
The document discusses five problems from a problem set. For the first problem, the author proves that for any nine integers there exists a subset of five integers whose sum is divisible by five. For the second problem, the author shows that any power of two beginning in 2009 can be expressed as 2009*10^m < 2^n < 2010*10^m for some integers m and n. The third problem asks to find the largest conspiratorial subset of integers from 1 to 16, which the author shows is eleven elements. The fourth problem charact
- Author
- TrungNguyễnChí
- Language
- EN