Question
Question: Let n > 4 be a natural number and let P be a polygon with 'n' sides. Let $a_1, a_2, a_3$,...., $a_n$...
Let n > 4 be a natural number and let P be a polygon with 'n' sides. Let a1,a2,a3,...., an be the lengths of the sides of P and let 'p' be its perimeter. Then find the [∑i=1np−aiai], where [.] denotes greatest integer function.

Answer
1
Explanation
Solution
- Polygon Property: For any polygon, the sum of the lengths of any (n-1) sides must be strictly greater than the length of the remaining side. This implies p−ai>ai for each side ai, where p is the perimeter.
- Upper Bound: From p−ai>ai, we get p>2ai, or ai<p/2. Using this, we can write p−aiai<p/2ai=p2ai. Summing over all sides: ∑i=1np−aiai<∑i=1np2ai=p2∑i=1nai=p2⋅p=2. So, the sum is less than 2.
- Lower Bound: Rewrite each term as p−aiai=p−aip−1. The sum becomes S=p∑i=1np−ai1−n. Let xi=p−ai. Using the AM-HM inequality, ∑i=1nxi1≥∑i=1nxin2. Substituting xi=p−ai, we have ∑i=1nxi=∑i=1n(p−ai)=np−∑i=1nai=np−p=p(n−1).
So, S≥pp(n−1)n2−n=n−1n2−n=n−1n2−n(n−1)=n−1n. 4. Conclusion: We have S≥n−1n and S<2. Since n>4, the smallest value of n−1n occurs at n=5, which is 45=1.25. As n increases, n−1n approaches 1. Therefore, for n>4, 1<n−1n≤S<2. Since S is strictly between 1 and 2, its greatest integer value [S] is 1.