Ask your own question, for FREE!
Mathematics 24 Online
OpenStudy (anonymous):

given a set of (n+1) integers, none of which exceeds 2n, show that at least one of the numbers in the set must divide another number of the set

OpenStudy (anonymous):

..Do you mean one of the numbers is divisible?

OpenStudy (anonymous):

yep! I think I figured it out... I'll have to use induction to do this one :)

OpenStudy (anonymous):

Sorry I haven't had to do a proof by induction in years.

OpenStudy (anonymous):

yeah, i just figures it's not that... it's supposed to the Pigeonhole Principle (I THINK)

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!