Statement

Use mathematical induction to show that given a set of n + 1 positive integers, none exceeding 2n, there is at least one integer in this set that divides another integer in the set.

It's clear that the set can't contain two equal integers because one divides the other.

Basis step:

When n=1 the set S has two positive integers, namely S = {1,2}, and 1 divides 2.

Inductive step

Let's assume that when a set S has K+1 positive integers and each one is not greater than 2K, there is at least one integer in this set that divides another integer in the set.

Now I'm stuck, I don't know how to show that assuming this hypothesis I can prove that the statement holds for (K+1)+1.

• In general your question will be better received if you show some effort beyond simply stating the problem. For example, what have you tried? Is there somewhere specific that you are stuck at? You might say something like "I know induction is..., but I can't seem to prove ..." or "I tried doing it for n=..." – Kitter Catter Jan 27 '17 at 19:42
• Yes, you're right, sorry for that. – Antonio González Borrego Jan 27 '17 at 19:47
• So I notice that in the $K+1$ step you essentially either have the pair that fulfills the requirement or you must include $2K+1$ and $2K+2$ perhaps there is something in that direction? – Kitter Catter Jan 27 '17 at 21:19
• Well, I really look at the notebook, but I can't see anything. – Antonio González Borrego Jan 28 '17 at 0:16