Ask your own question, for FREE!
Discrete Math 21 Online
OpenStudy (darkprince14):

Pigeonhole Principle Show that if n+1 integers are chosen from the set {1,2,...,3n} then there are always two integers which differ at most by 2

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!