This preview shows page 1. Sign up to view the full content.
Unformatted text preview: …
CS204 Discrete Math (Fall 2009) firstname.lastname@example.org 7 CS204 Discrete Math (Fall 2009) email@example.com 8 Pigeonhole Principle Homework #7 • Let f be a function from a finite set X into a
finite set Y. Suppose that |X|=n and |Y|=m. Let
k= n/m . Then there are at least k values a1,
… , ak X such that f(a1) = f(a2) = … f(ak).
such that f(a
f( • Due: October 19 (Monday) 11 AM
October 19 (Monday) 11 AM
• [6.4] #22
• [6.8] #6, 12
#6 12 • Examples
– In any group of six people, at least three must be...
View Full Document
This note was uploaded on 04/15/2013 for the course MAS 223 taught by Professor Shin during the Spring '13 term at Korea Advanced Institute of Science and Technology.
- Spring '13