asif zaidi
- 56
- 0
Hello:
Problem1:
The temp of the circular plate D= {(x1,x2) | x1^{2} + x2^{2} \leq 1} is given by T=2x^{2} -3y^{2} - 2x. Find hottest and coldest points of the plate.
Problem 2
Show that for all (x1,x2,x3) \in R^{3} with x1>0, x2>0, x3>0 and x1x2x3 = 1, we have x1+x2+x3 \geq3
Solution to problem1
First I think there is a typo in the problem. D is given in terms of x1,x2 and T in terms of x,y. Shouldn't they both be in terms of either x1x2 or xy. If so then I have xy value s which I need to plug into T to find the max and min.
Solution to problem2:
This is where I am having real problems. I am not sure what my constraining function is.
What I have done so far is the following (and this is the crucial step which I may have gotten wrong). My question for this problem is at end.
Maximize a1+a2+a3 subject to a1a2a3 = 1. Formulating this gives me the following
i + j + k = \lambda(a2a3) i + \lambda(a1a3) j + \lambda(a1a2) k
Therefore
1 = \lambda(a2a3);
1 = \lambda(a1a3);
1 = \lambda(a1a2);
Multiplying lhs and rhs in above 3 gives me following
a1 = \lambda(a2a3)a1;
a2 = \lambda(a1a3)a2;
a3 = \lambda(a1a2)a3;
This gives me a1 = a2 = a3
Putting this above in constraint gives me
a1a1a1 = 1;
Therefore a1 = 1 = a2 = a3
So I am able to a1+a2+a3 = 3.
But I have not been able to prove a1+a2+a3>3. Any pointers.
Thanks
Asif
Problem1:
The temp of the circular plate D= {(x1,x2) | x1^{2} + x2^{2} \leq 1} is given by T=2x^{2} -3y^{2} - 2x. Find hottest and coldest points of the plate.
Problem 2
Show that for all (x1,x2,x3) \in R^{3} with x1>0, x2>0, x3>0 and x1x2x3 = 1, we have x1+x2+x3 \geq3
Solution to problem1
First I think there is a typo in the problem. D is given in terms of x1,x2 and T in terms of x,y. Shouldn't they both be in terms of either x1x2 or xy. If so then I have xy value s which I need to plug into T to find the max and min.
Solution to problem2:
This is where I am having real problems. I am not sure what my constraining function is.
What I have done so far is the following (and this is the crucial step which I may have gotten wrong). My question for this problem is at end.
Maximize a1+a2+a3 subject to a1a2a3 = 1. Formulating this gives me the following
i + j + k = \lambda(a2a3) i + \lambda(a1a3) j + \lambda(a1a2) k
Therefore
1 = \lambda(a2a3);
1 = \lambda(a1a3);
1 = \lambda(a1a2);
Multiplying lhs and rhs in above 3 gives me following
a1 = \lambda(a2a3)a1;
a2 = \lambda(a1a3)a2;
a3 = \lambda(a1a2)a3;
This gives me a1 = a2 = a3
Putting this above in constraint gives me
a1a1a1 = 1;
Therefore a1 = 1 = a2 = a3
So I am able to a1+a2+a3 = 3.
But I have not been able to prove a1+a2+a3>3. Any pointers.
Thanks
Asif