{% extends "layout.html" %} {% block title %} Optimized {% endblock %} {% block main %}

Your function is $f(x) = {{ value }}$

Your maximum value is ${{ maximum }}$ and your minimum value is ${{ newvar }}$

{% for solution in solutions %} {% endfor %} {% for candidate in candidates %} {% endfor %}
Step 1 Take the Derivative
$f'(x) = {{ fprime }}$
Step 2 Set $f'(x) = 0$
$0 = {{ fprime }}$
Step 3 Solve for $x$:
$x = {{ solution }}$
Step 4 Plug solutions and endpoints into $f(x)$:
$f({{ candidate }}) = {{values[loop.index - 1]}}$
Step 5 Grab the highest and lowest values
Your maximum value is ${{ maximum }}$
Your minimum value is ${{ newvar }}$
{% endblock %}