Difficult max and min

Suppose \(\alpha,\beta,\gamma\in [0,\frac{\pi}{2}]\) and \(\cos\alpha +\cos\beta +\cos\gamma=1\).

How to get the maximum and minimum of the expression sin4α+sin4β+sin4γ\sin^{4}\alpha+\sin^{4}\beta+\sin^{4}\gamma ?

Any good ideas?

#Algebra

Note by Haosen Chen
3 years ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

The problem is equivalent to determine the maximum and minimum of (1x2)2+(1y2)2+(1z2)2(1-x^{2})^{2}+(1-y^{2})^{2}+(1-z^{2})^{2} given that x,y,z[0,1]x,y,z\in[0,1] and x+y+z=1x+y+z=1.

Let x+y=tx+y=t where tt is a fixed parameter. Then (1x2)2+(1y2)2+(1z2)2(1-x^{2})^{2}+(1-y^{2})^{2}+(1-z^{2})^{2}=(1x2)2+(1(tx)2)2+(1(1t)2)2(1-x^{2})^{2}+(1-(t-x)^{2})^{2}+(1-(1-t)^{2})^{2},which can be seen as a function of xx,say, f(x)f(x).

Its derivative is f(x)=4(2xt)(x2tx+t21)f'(x)=4(2x-t)(x^{2}-tx+t^{2}-1)=8=8(xt43t22)(x-\frac{ t-\sqrt{4-3t^{2}} }{2})(xt2)(x-\frac{t}{2})(xt+43t22)(x-\frac{ t+\sqrt{4-3t^{2}} }{2}).

Since 0t10\le t \le 1,it’s clear thatt43t220\frac{ t-\sqrt{4-3t^{2}} }{2}\le 0 and 1t+43t221\le \frac{ t+\sqrt{4-3t^{2}} }{2}.

Thus,f(x)f(x) is increasing on the interval (0,t2)(0,\frac{t}{2}) and decreasing on the interval (t2,t)(\frac{t}{2},t).

Hence, every fixed parameter tt,the maximum and minimum of f(x)f(x) are f(t2)=2(1(t2)2)2+(1(1t)2)2f(\frac{t}{2})=2(1-(\frac{t}{2})^{2})^{2}+(1-(1-t)^{2})^{2} and f(0)(=f(t))=1+(1t2)2+(1(1t)2)2f(0)(=f(t))=1+(1-t^{2})^{2}+(1-(1-t)^{2})^{2} respectively,which can also be seen as functions of tt,say,g(t)g(t) and h(x)h(x) respectively. Again,culculate their derivatves: g(t)=92t(t23)(t2)g'(t)=\frac{9}{2}t(t-\frac{2}{3})(t-2),h(t)=8t(t12)(t1)h'(t)=8t(t-\frac{1}{2})(t-1).

So we see that g(t)g(23)=6427g(t)\le g(\frac{2}{3}) = \frac{64}{27} and h(t)h(0)=2h(t)\ge h(0) =2,for all 0t10\le t \le 1.

Therefore, the maximum and minimum of (1x2)2+(1y2)2+(1z2)2(1-x^{2})^{2}+(1-y^{2})^{2}+(1-z^{2})^{2} are 6427\frac{64}{27} and 22,respectively.

Haosen Chen - 2 years, 12 months ago

How about putting cosα=a,cosβ=b,cosγ=c\cos\alpha=a,\cos\beta=b,\cos\gamma=c,so a+b+c=1a+b+c=1 and then find the max and min of (1a2)2+(1b2)2+(1c2)2(1-a^2)^2+(1-b^2)^2+(1-c^2)^2

X X - 3 years ago

Log in to reply

Oh,thanks for attention,it does work.In fact,I have solved this problem already(on yesterday's morning) and I will put my solution here this Sunday.

Haosen Chen - 3 years ago
×

Problem Loading...

Note Loading...

Set Loading...