Inequality Proof: Proving a(b+c) < 1/sqrt(2)

[siddharthmishra19]

1. The Problem

For all positive real values of a,b and c such that a²+b²+c²=1, prove that
a(b+c) < [1/sqrt(2)]

2. My Attempt...

There are probably numerous ways to solve this, but i tried this way...

let a = sin(x)
b = cos(x)sin(y)
c = cos(x)cos(y)

a²+b²+c² = sin²(x)+cos²(x)[sin²(y)+cos²(y)] = 1
This satisfies the above

so a(b+c) = sin(x)cos(x)[sin(y)+cos(y)]
=(1/2)sin2(x)[sin(y)+cos(y)]...

I am sure you can somehow prove that the max value of the give is less than than the value given in the question i.e. 1/sqrt(2)...

I would appreciate any help... with any other methods.

 

[AlephZero]

Write sin(y) + cos(y) in the form A sin(y+p).

 

[siddharthmishra19]

Write sin(y) + cos(y) in the form A sin(y+p).

Sorry I'm quite weak in trigonometry... could you elaborate?

 

[HallsofIvy]

Csin(y+ B)= Csin(y)cos(B)+ Ccos(y)sin(B) = C cos(B)sin(y)+ C sin(B)cos(y)

You want to find C and B so that C cos(B)= 1 and C sin(B)= 1. Of course, then C²cos²(B)+ C²sin²(B)= C²= 1+ 1= 2. That is, C= \sqrt{2} so that C cos(B)= 1 becomes \sqrt{2}cos(B)= 1 and
cos(B)= \frac{1}{\sqrt{2}}

 

[siddharthmishra19]

Any other simpler methods?

 

[AlephZero]

Your method looks pretty simple.

The "plug and pray" method would be to find the extreme values of f(a,b,c) = a(b+c) with the constraint g(a,b,c) = a^2+b^2+c^2 =1 using the Lagrange Multiplier method.

Personally I think your way is neater for this problem.