Let , and be a subset of , satisfying that any element of is a multiple or a divisor of any other element of .
How many elements at most are there in ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
In fact, is not possible to make any subset B whit more than 11 elements whit this property.
Let's suppose that is possible to make a set with 12 or more elements using this property.
Be B a subset of A with k ≥ 1 2 elements. Be n the greater element of B.
n need to have k positive divisors ( n itself and the other k − 1 elements.
The grater number with k positive integers is m ( k − 1 ) . If m is 2 , we a problem:
2 ( k − 1 ) > 2 1 1 = 2 0 4 8 2 0 1 5 because k = 1 2 . Thus n > 2 0 1 5 ∈ / B what is a contradiction. If m is greater than 2, the same problem appears. It proves that the number of elements in set B can't be 12 or more.
The the answer is 11.