Thesumoftwopositivenumbersis16.whatisthesmallest possible value of the sum of their squares?

1 answer:

5 0

X+y=16
the sum of the squares is
x^2+y^2=sum

solve for y in first equation
x+y=16
y=16-x
subsitiute that for y in other equation

x^2+(16-x)^2=sum
x^2+x^2-32x+256=sum
2x^2-32x+256=sum
take derivitive to find the minimum value (or just find the vertex because the parabola opens up)
derivitive is
4x-32=derivitve of sum
the max/min is where the derivitive equals 0
4x-32=0
4x=32
x=8

at x=8
so then y=16-8=8

the smallest value then is 8^2+8^2=64+64=128

You might be interested in

If the ratio of blue marbles to red is 9:4 what is possible number of blue and red marbles in the jar

LuckyWell [14K]

Answer:

Step-by-step explanation:

13 right? all ya gotta do is add em together right?

5 0

2 years ago

Prove A-(BnC) = (A-B)U(A-C), explain with an example

NikAS [45]

Answer:

Prove set equality by showing that for any element $x$ , $x \in (A \backslash (B \cap C))$ if and only if $x \in ((A \backslash B) \cup (A \backslash C))$ .

Example:

$A = \lbrace 0,\, 1,\, 2,\, 3 \rbrace$ .

$B = \lbrace0,\, 1 \rbrace$ .

$C = \lbrace0,\, 2 \rbrace$ .

$\begin{aligned} & A \backslash (B \cap C) \\ =\; & \lbrace 0,\, 1,\, 2,\, 3 \rbrace \backslash \lbrace 0 \rbrace \\ =\; & \lbrace 1,\, 2,\, 3 \rbrace \end{aligned}$ .

$\begin{aligned}& (A \backslash B) \cup (A \backslash C) \\ =\; & \lbrace 2,\, 3\rbrace \cup \lbrace 1,\, 3 \rbrace \\ =\; & \lbrace 1,\, 2,\, 3 \rbrace\end{aligned}$ .

Step-by-step explanation:

Proof for $[x \in (A \backslash (B \cap C))] \implies [x \in ((A \backslash B) \cup (A \backslash C))]$ for any element $x$ :

Assume that $x \in (A \backslash (B \cap C))$ . Thus, $x \in A$ and $x \not \in (B \cap C)$ .

Since $x \not \in (B \cap C)$ , either $x \not \in B$ or $x \not \in C$ (or both.)

If $x \not \in B$ , then combined with $x \in A$ , $x \in (A \backslash B)$ .
Similarly, if $x \not \in C$ , then combined with $x \in A$ , $x \in (A \backslash C)$ .

Thus, either $x \in (A \backslash B)$ or $x \in (A \backslash C)$ (or both.)

Therefore, $x \in ((A \backslash B) \cup (A \backslash C))$ as required.

Proof for $[x \in ((A \backslash B) \cup (A \backslash C))] \implies [x \in (A \backslash (B \cap C))]$ :

Assume that $x \in ((A \backslash B) \cup (A \backslash C))$ . Thus, either $x \in (A \backslash B)$ or $x \in (A \backslash C)$ (or both.)

If $x \in (A \backslash B)$ , then $x \in A$ and $x \not \in B$ . Notice that $(x \not \in B) \implies (x \not \in (B \cap C))$ since the contrapositive of that statement, $(x \in (B \cap C)) \implies (x \in B)$ , is true. Therefore, $x \not \in (B \cap C)$ and thus $x \in A \backslash (B \cap C)$ .
Otherwise, if $x \in A \backslash C$ , then $x \in A$ and $x \not \in C$ . Similarly, $x \not \in C \!$ implies $x \not \in (B \cap C)$ . Therefore, $x \in A \backslash (B \cap C)$ .