Let be the set of all of the multisets containing 10 positive integers such that these integers cannot be the side lengths of a decagon. If is a set in and is the sum of the elements of , find the smallest value that can have.
A multiset is an unordered collection of elements that may repeat; compare this with a set, which may not repeat elements, or with a sequence, which is ordered.
Bonus: Can you generalize this for the -gon?
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.
Let a i be the i th element of A where 1 ≤ i ≤ 1 0 .
S ( A ) = i = 1 ∑ 1 0 a i = a 1 + a 2 + . . . + a 9 + a 1 0
WLOG, we let a 1 ≤ a 2 ≤ . . . ≤ a 1 0
For something to be a decagon, no side length can be greater than or equal to the sum of the other nine sides. Our set A must fail this condition, therefore we have:
a 1 + a 2 + . . . + a 9 ≤ a 1 0
a 1 + a 2 + . . . + a 9 + a 1 0 ≤ 2 a 1 0
S ( A ) ≤ 2 a 1 0
By the Least Upper Bound Property, any non-empty set of real numbers that has an upper bound necessarily has a least upper bound. If 2 a 1 0 is the upper bound for S ( A ) , to find the least upper bound we must minimize a 1 0 .
1 ≤ a i ∀ i ⟹ 9 ≤ i = 1 ∑ 9 a i ≤ a 1 0
9 + a 1 0 ≤ S ( A ) ≤ 2 a 1 0
We now have a 1 0 = 9 as a minimum, meaning that the least upper bound for S ( A ) is 2 ( 9 ) = 1 8 . However, our last inequality gives us a lower bound of 9 + a 1 0 = 9 + 9 = 1 8 . Due to the Squeeze Theorem, if X ≤ Y ≤ Z and X = Z , then X = Y = Z . Since 1 8 ≤ S ( A ) ≤ 1 8 , we have our minimum value S ( A ) = 1 8 .
The proof of the generalization is quite similar, but I'll leave the fun of that to you ;)