Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1? 5,–1, –7, –13, –19,
2 answers:
You might be interested in
We're minimizing 
subject to 
. Using Lagrange multipliers, we have the Lagrangian
with partial derivatives
Set each partial derivative equal to 0:
Subtracting the second equation from the first, we find
Similarly, we can determine that
and 
by taking any two of the first three equations. So if 
determines a critical point, then
So the smallest value for the sum of squares is
when 
.
with partial derivatives
Set each partial derivative equal to 0:
Subtracting the second equation from the first, we find
Similarly, we can determine that
So the smallest value for the sum of squares is