A community for students. Sign up today!
Here's the question you clicked on:
← 55 members online
 0 viewing
 2 years ago
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
 2 years ago
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

This Question is Closed

14yamaka
 2 years ago
Best ResponseYou've already chosen the best response.0..Do you mean one of the numbers is divisible?

kwenisha
 2 years ago
Best ResponseYou've already chosen the best response.0yep! I think I figured it out... I'll have to use induction to do this one :)

MrYantho
 2 years ago
Best ResponseYou've already chosen the best response.0Sorry I haven't had to do a proof by induction in years.

kwenisha
 2 years ago
Best ResponseYou've already chosen the best response.0yeah, i just figures it's not that... it's supposed to the Pigeonhole Principle (I THINK)
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.