I've come across challenge proof question in my discrete mathematics textbook that I'm trying to solve for practice but unfortunately it does not have a solution. Any help with a reasonable explanation or solution so that I can understand where to start and verify my work would be greatly appreciated:
Can you draw a pentagon (5-sided figure) in which the sum of any two angles – for every two angles you pick – is less than $216^o$? Explain how to do it, or prove that it can not be done.
Hints:
(1) the sum of the angles in a pentagon is always $540^o$.
(2) Look at two different ways of computing $4(\Theta1 + \Theta2 + \Theta3 + \Theta4 + \Theta5)$, where $\Theta i$ is the value of the $i$th angle of the pentagon.
Thank you!
Let $\theta_i$ be the angles and let's assume that it's possible to draw such a pentagon. So, $\theta_i + \theta_{j} < 216º$ for all $i$ and $j \neq i$.
Hence, $(\theta_1 + \theta_2) + (\theta_2 + \theta_3) + (\theta_3 + \theta_4) + (\theta_4 + \theta_5) + (\theta_5 + \theta_1) < 5 \times 216º$.
Rearranging the terms we get: $2(\theta_1 + \theta_2 + \theta_3 + \theta_4 + \theta_5) < 1080º$, i.e., $2 \times 540º < 1080º$, which is false.