UI Putnam Training Sessions, Advanced Level Problem Set 2
... Solution: 310 Encode each such pair (A, B) by a 10-letter code word, whose i-th letter is A if the number i belongs to A, B if i belongs to B, and O otherwise. (The disjointness condition ensures that exactly one of those three cases must occur, so the encoding is well defined.) For example, the pai ...
... Solution: 310 Encode each such pair (A, B) by a 10-letter code word, whose i-th letter is A if the number i belongs to A, B if i belongs to B, and O otherwise. (The disjointness condition ensures that exactly one of those three cases must occur, so the encoding is well defined.) For example, the pai ...
Revised Version 070216
... since we add odd to odd and even to even. Even though we will always have to deal with one ungrouped number, this sum is still even and a natural number. We can use the same technique used above to form a general view of what happens when we add the first n natural numbers. The general case is also ...
... since we add odd to odd and even to even. Even though we will always have to deal with one ungrouped number, this sum is still even and a natural number. We can use the same technique used above to form a general view of what happens when we add the first n natural numbers. The general case is also ...
