Impossible Decagon

Geometry Level 5

Let D D 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 A A is a set in D D and S ( A ) S(A) is the sum of the elements of A A , find the smallest value that S ( A ) S(A) 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 n n -gon?


The answer is 18.

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.

1 solution

Garrett Clarke
Jun 20, 2015

Let a i a_i be the i i th element of A A where 1 i 10 1\leq i \leq 10 .

S ( A ) = i = 1 10 a i = a 1 + a 2 + . . . + a 9 + a 10 S(A)=\displaystyle \sum_{i=1}^{10} a_i=a_1+a_2+...+a_9+a_{10}

WLOG, we let a 1 a 2 . . . a 10 a_1 \leq a_2 \leq ... \leq a_{10}

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 A must fail this condition, therefore we have:

a 1 + a 2 + . . . + a 9 a 10 a_1+a_2+...+a_9 \leq a_{10}

a 1 + a 2 + . . . + a 9 + a 10 2 a 10 a_1+a_2+...+a_9+a_{10} \leq 2a_{10}

S ( A ) 2 a 10 S(A) \leq 2a_{10}

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 10 2a_{10} is the upper bound for S ( A ) S(A) , to find the least upper bound we must minimize a 10 a_{10} .

1 a i 1 \leq a_i i 9 i = 1 9 a i a 10 \forall i \Longrightarrow 9\leq \displaystyle \sum_{i=1}^9 a_i \leq a_{10}

9 + a 10 S ( A ) 2 a 10 9+a_{10} \leq S(A) \leq 2a_{10}

We now have a 10 = 9 a_{10}=9 as a minimum, meaning that the least upper bound for S ( A ) S(A) is 2 ( 9 ) = 18 2(9)=18 . However, our last inequality gives us a lower bound of 9 + a 10 = 9 + 9 = 18 9+a_{10}=9+9=18 . Due to the Squeeze Theorem, if X Y Z X \leq Y \leq Z and X = Z X=Z , then X = Y = Z X=Y=Z . Since 18 S ( A ) 18 18\leq S(A) \leq 18 , we have our minimum value S ( A ) = 18 S(A) = \boxed{18} .

The proof of the generalization is quite similar, but I'll leave the fun of that to you ;)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...