# Thread:

1. ## Optimization Problem

Find the larger of two numbers whose sum is 30 for which the sum of their squares is a minimum.

2. Let the first number $x_1$ and the second number $x_2$.

Then $f\left( {x_1 ,x_2 } \right) = x_1^2 + x_2^2 \to \min$ and $x_1+x_2=30\Rightarrow$.

$\Rightarrow x_2=30-x_1\Rightarrow f\left( {x_1 } \right) = x_1^2 + \left( {30-x_1} \right)^2 \to \min$

Do you undestand?

3. Originally Posted by abclarinetuvwxyz

Find the larger of two numbers whose sum is 30 for which the sum of their squares is a minimum.
Denote these two numbers to be $x$ and $y$.

#1: Their sum must be 30, so: $x+y=30$, or $y=30-x$

#2: And you want to minimize: $x^2+y^2$

Given #1 as a constraint, #2 becomes: $x^2+(30-x)^2$. Differentiate this expression, set it equal to zero (to minimize), and find $x$
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 12, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9344733357429504, "perplexity_flag": "middle"}