6

Problem. Let $a, b, c, d, e$ be real numbers such that $a + b + c + d + e = 2\pi$. Find the maximum of $\sin a + \sin b + \sin c + \sin d + \sin e$.

This is from a closed question which is a PSQ (does not meet the requirement).

The existing solution apply the method of Lagrange Multipliers (LM).

Question. Are there any solutions without using LM?

Existing solution. By @user123234

Using the method of Lagrange multipliers you immediately get to this. Let me first define $g=a+b+c+d+e-2\pi=0$ then the lagrange function is $$L(a,b,c,d,\lambda)=E-\lambda g=\sin(a)+\sin(b)+\sin(c)+\sin(d)+\sin(e)-\lambda(a+b+c+d+e-2\pi)$$ Now for lagrange you need to compute all partial derivatives. $$\frac{\partial L}{\partial x}=\cos(x)-\lambda$$ for $x\in \{a,b,c,d\}$ and $$\frac{\partial L}{\partial \lambda}=a+b+c+d+e=2\pi$$ Then you only need to solve the system$$\frac{\partial L}{\partial x}=\cos(x)-\lambda=0\Leftrightarrow \cos(x)=\lambda$$ for $x\in \{a,b,c,d\}$ and you immediately get that $a=b=c=d=e=\frac{2\pi}{5}$.

River Li
  • 49,125
  • 2
    We have $\sin a+\sin b=2\sin\frac{a+b}2\cos\frac{a-b}2$. If $a+b$ is fixed, then maximum (if it exists) is obtained for $\cos\frac{a-b}2=\pm1$. The same is for any pair of variables. Does this help? – youthdoo Mar 12 '25 at 16:14
  • 2
    If all arguments are in the range $[0, \pi]$ then the result follows immediately from the concavity of the sine on that interval. – Martin R Mar 12 '25 at 16:29
  • @MartinR Thanks. I think we only need to find one maximizer rather than all maximizers. – River Li Mar 13 '25 at 00:25
  • @youthdoo Thanks. We can reduce the problem to $f(x, y)$ for $x, y \in \mathbb{R}$ as follows. The remaining is smooth. In particular, I want to know if there is a solution without using derivatives. Let $f := \sin a + \sin b + \sin c + \sin d + \sin e$. Let $x := \frac{a+b}{2}$ and $y := \frac{c+d}{2}$. We have \begin{align*} f &= 2\sin \frac{a + b}{2} \cos \frac{a - b}{2} + 2\sin \frac{c+d}{2} \cos \frac{c-d}{2}
    • \sin(a + b + c + d)\

    &\le 2|\sin x| + 2|\sin y| - \sin(2x + 2y). \end{align*}

    – River Li Mar 13 '25 at 01:49
  • 2
    A geometric interpretation: among all cyclic pentagons, the regular pentagon has the greatest area. (The generalization of this problem to $n$-gons has been considered previously, e.g., https://math.stackexchange.com/q/1919440/137524.) – Semiclassical Mar 13 '25 at 07:30
  • @Semiclassical: Unless I am mistaken, that geometric interpretation works only if $a, b, c, d, e$ are all nonnegative. In fact the generalization fails for $n \ge 7$ if one allows negative arguments. – Martin R Mar 13 '25 at 19:12
  • @MartinR Good point---I hadn't noticed that the angles could be negative – Semiclassical Mar 13 '25 at 19:18
  • Note that the “existing solution” has a flaw: $\cos(x)=\lambda$ for $x\in {a,b,c,d}$ does not imply $a=b=c=d=e$, unless you assume that all angles are non-negative. – Martin R Mar 15 '25 at 17:11
  • @MartinR Yes, this statement is flawed and a revision is required. – River Li Mar 15 '25 at 22:42
  • @MartinR When using LM for $n = 7$, we can not say $x_1 = \cdots = x_7$. – River Li Mar 15 '25 at 23:56

4 Answers4

5

The following proof uses a combination of the reduction modulo $2 \pi$ from River Li's answer and a concavity argument.

Let $x_1, \ldots, x_5$ be real numbers with $\sum_{k=1}^5 x_k = 2 \pi$. We want to show that $\sum_{k=1}^5 \sin(x_k) \le 5 \sin \left( \frac{2 \pi}{5}\right) $.

Case 1: $\sin(x_k) \le 0$ for some $k$. Then $$ \sum_{k=1}^5 \sin(x_k) \le 4 < 5 \sin \left( \frac{2 \pi}{5}\right) \, . $$

Case 2: $\sin(x_k) > 0$ for all $k$. Then $$ x_k = y_k + 2 p_k \pi $$ with $y_1, \ldots, y_5 \in (0, \pi)$ and $p_1, \ldots, p_5 \in \Bbb Z$. Using the concavity of the sine function on $(0, \pi)$ it follows that $$ \sum_{k=1}^5 \sin(x_k) = \sum_{k=1}^5 \sin(y_k) \le 5 \sin \left( \frac{\sum_{k=1}^5 y_k}{5}\right) = 5 \sin \left( \frac{2 q \pi}{5}\right) \le 5 \sin \left( \frac{2 \pi}{5}\right) $$ with some $q \in \Bbb Z$, and that finishes the proof.

Equality holds if and only if all $y_k$ are equal and $q=1$, that is if $$ x_k = \frac{2 \pi}{5} + 2 p_k \pi $$ with integers $p_k$ satisfying $\sum_{k=1}^5 p_k = 0$.


This can be generalized as follows:

Let $x_1, \ldots, x_n$ ($n \ge 3$) be real numbers with $\sum_{k=1}^n x_k = 2 \pi$. Then $$ \sum_{k=1}^n \sin(x_k) \le n \sin \left( \frac{2 Q\pi}{n}\right) \quad\text{with } Q = \left\lfloor \frac n4 + \frac 12 \right\rfloor \, . $$ The bound is sharp.

Proof: Note that the integer $Q$ is chosen such that $\sin(2Q\pi/n)$ is as large as possible. As above we distinguish two cases.

Case 1: $\sin(x_k) \le 0$ for some $k$. Then $ \sum_{k=1}^n \sin(x_k) \le n-1 $ and it remains to show that $$ n-1 \le n \sin \left( \frac{2 Q\pi}{n}\right) \, . $$

This can be verified directly for $n=3, 4$ with $Q=1$. For $n\ge 5$ we have $$ \left| \frac{2 Q\pi}{n} - \frac{\pi}{2} \right| \le \frac{\pi}{n} $$ and therefore $$ \sin \left( \frac{2 Q\pi}{n}\right) \ge \sin \left( \frac{\pi}{2}-\frac{\pi}{n}\right) = \cos\left( \frac{\pi}{n}\right) \ge 1 - \frac{\pi^2}{2n^2} > 1 - \frac{1}{n} = \frac{n-1}{n} \, . $$

Case 2: $\sin(x_k) > 0$ for all $k$. Then $$ x_k = y_k + 2 p_k \pi $$ with $y_1, \ldots, y_n \in (0, \pi)$ and $p_1, \ldots, p_n \in \Bbb Z$. Using the concavity of the sine function on $(0, \pi)$ it follows that $$ \sum_{k=1}^n \sin(x_k) = \sum_{k=1}^n \sin(y_k) \le n \sin \left( \frac{\sum_{k=1}^n y_k}{n}\right) = n \sin \left( \frac{2 q \pi}{n}\right) \le n \sin \left( \frac{2 Q \pi}{n}\right) $$ with some $q \in \Bbb Z$, the last inequality holds due to the choice of $Q$.

Equality holds for $$ x_k = \frac{2 Q\pi}{n} + 2 p_k \pi $$ with integers $p_k$ satisfying $\sum_{k=1}^n p_k = 1-Q$.

Remark: If $n \ge 7$ then the maximal value is not attained if all $x_k$ are equal. For example, if $n=7$ then $Q=2$ and the maximal value is $7 \sin(4 \pi/7)$, which is attained (for example) for $$ x_1 = \cdots = x_6 = \frac{4\pi}{7} \, , \, x_7 = -\frac{10\pi}{7} \, . $$

Martin R
  • 128,226
  • Interestingly, the argument of case 1, ie $(x-1)<x\sin(2\pi/x)$ holds only for $x\in{3,4,5,6,}$. – Sahaj Mar 13 '25 at 19:41
  • @MartinR The maximum for $n\ge 7$ is interesting. Perhaps $n-1$ angles are equal at maximum? – River Li Mar 13 '25 at 23:07
  • @RiverLi: I have added the generalisation for arbitrary $n \ge 3$. – Martin R Mar 14 '25 at 03:38
  • @Sahaj: With the correct generalisation, Case 1 still works for arbitrary $n \ge 3$, see the updated answer. – Martin R Mar 14 '25 at 03:40
  • 1
    @MartinR Very nice. – River Li Mar 14 '25 at 06:05
  • The entire method looks unnecessarily cumbersome and complicated, given that the OP's question could be solved by elementary means. – M. Wind Mar 16 '25 at 19:42
  • 4
    @M.Wind I see this question has one downvote as I am typing this comment - was this you retaliating? Because your so-called solution completely lacks rigour and deserve the downvotes, while this one does not.

    And even more strangely, you consider Lagrange multiplier method to be more elementary than this ?

    – dezdichado Mar 16 '25 at 22:13
1

Sketch of a solution.

Clearly, there exist $k_1, k_2, k_3, k_4 \in \mathbb{Z}$ such that $a + 2k_1\pi, b + 2k_2\pi, c + 2k_3\pi, d + 2k_4\pi \in [0, 2\pi]$. Let $a_1 := a + 2k_1\pi, b_1 := b + 2k_2\pi, c_1 = c + 2k_3\pi, d_1 := d + 2k_4\pi$.

(1) If $a_1, b_1, c_1, d_1 \in [0, \pi]$, we have \begin{align*} &\sin a + \sin b + \sin c + \sin d + \sin e\\ ={}& \sin a_1 + \sin b_1 + \sin c_1 + \sin d_1 + \sin (2\pi - a_1 - b_1 - c_1 - d_1)\\ ={}& 2\sin \frac{a_1+b_1}{2}\cos \frac{a_1-b_1}{2} + 2\sin \frac{c_1+d_1}{2}\cos \frac{c_1-d_1}{2} - \sin(a_1 + b_1 + c_1 + d_1)\\ \le{}& 2\sin \frac{a_1+b_1}{2} + 2\sin \frac{c_1+d_1}{2} - \sin(a_1 + b_1 + c_1 + d_1)\\ \le{}& 4 \sin \frac{a_1 + b_1 + c_1 + d_1}{4} \cos \frac{a_1 + b_1 - c_1 - d_1}{4} - \sin(a_1 + b_1 + c_1 + d_1) \\ \le{}& 4 \sin \frac{a_1 + b_1 + c_1 + d_1}{4} - \sin(a_1 + b_1 + c_1 + d_1) \\ ={}& 4 \sin y - \sin 4y\\ \le{}& 5 \sin \frac{2\pi}{5} \end{align*} where $y := \frac{a_1+b_1+c_1+d_1}{4}$.

(2) Otherwise, we have $\sin a_1 + \sin b_1 + \sin c_1 + \sin d_1 \le 3$. Thus, we have \begin{align*} &\sin a + \sin b + \sin c + \sin d + \sin e\\ ={}& \sin a_1 + \sin b_1 + \sin c_1 + \sin d_1 + \sin e\\ \le{}& 4\\ <{}& 5\sin \frac{2\pi}{5}. \end{align*}

River Li
  • 49,125
1

By your work we need to find $$\max(2|\sin{x}|+2|\sin{y}|-\sin2(x+y))$$ and since the last expression does not depend on substitutions $x\rightarrow x\pm\pi$ and $y\rightarrow y\pm\pi$, we can assume $\{x,y\}\subset[0,\pi]$.

Now, by Jensen $$2|\sin{x}|+2|\sin{y}|-\sin2(x+y)=$$ $$=2(\sin{x}+\sin{y})-\sin2(x+y)\leq4\sin\frac{x+y}{2}-\sin2(x+y)$$ and from here we can get a maximal value by derivative.

Without using derivatives we can make the following.

For $x=y=\frac{2\pi}{5}$ we obtain a value $\frac{5}{4}\sqrt{10+2\sqrt5}.$

We'll prove that it's a maximal value.

Indeed, let $\cos\frac{x+y}{2}=t$, where $-1\leq t\leq1$.

Thus, we need to prove that $$4\sqrt{1-t^2}(1-t(2t^2-1))\leq\frac{5}{4}\sqrt{10+2\sqrt5}$$ or $$4\sqrt{(1+t)(1-t)^3}(1+2t+2t^2)\leq\frac{5}{4}\sqrt{10+2\sqrt5}$$ or $$128(1+t)(1-t)^3(1+2t+2t^2)^2\leq25(5+\sqrt5)$$ or $$(4t+1-\sqrt5)^2(64t^6+32(\sqrt5-1)t^5-8(7+3\sqrt5)t^4-32(2+\sqrt5)t^3+(38-14\sqrt5)t^2+(46+30\sqrt5)t+18\sqrt5+29)\geq0,$$ which is true even for any real value of $t$.

-1

A straightforward method is to eliminate one of the five variables, for example $e$. Then:

$$f(a,b,c,d) = \sin(a) + \sin(b) + \sin(c) + \sin(d) + \sin(2\pi -a-b-c-d)$$

Now optimize $f$ with respect to $a$, $b$, $c$ and $d$. This way you get: $$\cos(a)=\cos(b)=\cos(c)=\cos(d) =\cos(2\pi-a-b-c-d)$$

Or equivalently: $$\cos(a)=\cos(b)=\cos(c)=\cos(d)=\cos(e)$$

with $$a+b+c+d+e = 2\pi$$

From the properties of the cosine function we derive that if we choose $a = \phi$ then $b = \pm \phi + 2k\pi$ with $k$ arbitrary and similarly for $c$, $d$ and $e$. We can now test a few combinations with the help of a pocket calculator. We see that the sum of the sines has a maximum $5\sin(2\pi/5) = 4.76$ when the signs are all pluses and $\phi=2\pi/5$. Mathematical rigour is not required to solve the puzzle.

M. Wind
  • 4,270
  • Setting the gradient equal to zero yields $$\cos a = \cos b = \cos c = \cos d = -\cos(2\pi - a - b - c - d)$$ which yields more extrema – whpowell96 Mar 12 '25 at 18:51
  • 2
    Do you miss the details of "Now optimize $f$ with respect to $a, b, c, d$"? – River Li Mar 13 '25 at 00:28