Calculus - How to minimize x^2 + (1/x^2)

  • Thread starter Thread starter yoyo16
  • Start date Start date
  • Tags Tags
    Calculus
yoyo16
Messages
35
Reaction score
0

Homework Statement



Find a positive number such that the sum of the square of the number and its reciprocal is a minimum.

Homework Equations





The Attempt at a Solution


y=X^2+(1/X^2)
Derivative=2x-2x^(-3)
0=2x-2x^3
2/x^3=2x
2=2x^4
1=x^4
x=1

The answer I got was 1 but I'm not sure if this is right. Can someone please tell me if I did it right or wrong. If wrong, can you point out my mistake. Thanks :)
 
Physics news on Phys.org
[strike]Looks good except that you missed a possible solution. What other value of x satisfies x^4=1?[/strike]

Oops, never mind. I didn't notice you were looking for a positive number.

You just now need to verify that the critical point corresponds to a minimum.
 
Is it possible for the minimum to be a smaller value or would the smallest value be 1?
 
yoyo16 said:
Is it possible for the minimum to be a smaller value or would the smallest value be 1?

If the graph is concave up for ##x>0## your relative minimum will be an absolute minimum on that interval. Have you checked that?
 
yoyo16 said:

Homework Statement



Find a positive number such that the sum of the square of the number and its reciprocal is a minimum.

Homework Equations





The Attempt at a Solution


y=X^2+(1/X^2)
Derivative=2x-2x^(-3)
0=2x-2x^3
2/x^3=2x
2=2x^4
1=x^4
x=1

The answer I got was 1 but I'm not sure if this is right. Can someone please tell me if I did it right or wrong. If wrong, can you point out my mistake. Thanks :)

Your function is strictly convex in the convex region {x > 0}, so any stationary point is automatically a global minimum within the region.
 
Oh ok so since it is absolute it would be 1 right?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top