diff --git a/psets/pset5.ipynb b/psets/pset5.ipynb
index 0b8d98e..a05266a 100644
--- a/psets/pset5.ipynb
+++ b/psets/pset5.ipynb
@@ -61,7 +61,7 @@
     "```jl\n",
     "d²gdλ²(λ; r=0.5) = ForwardDiff.derivative(λ -> dgdλ(λ; r=0.5), λ)\n",
     "```\n",
-    "Use this to implement a Newton iteration to maximize $g(\\lambda)$ (for $$\\lambda \\ge 0$$) by finding a root of $g'(\\lambda)$, starting with an initial guess of $\\lambda=0$, for $r = 0.5$.  (It should converge in only a few iterations.  The solution should have $\\lambda > 0$ in this case because \_\_\_\_\_\_.)   To at least 8 significant digits, give the resulting dual optimum $\\lambda_*$ and the primal optimum $x_*$ (strong duality holds in this convex problem!), and check that $x_*$ is feasible."
+    "Use this to implement a Newton iteration to maximize $g(\\lambda)$ (for $\\lambda \\ge 0$) by finding a root of $g'(\\lambda)$, starting with an initial guess of $\\lambda=0$, for $r = 0.5$.  (It should converge in only a few iterations.  The solution should have $\\lambda > 0$ in this case because ...?)   To at least 8 significant digits, give the resulting dual optimum $\\lambda_*$ and the primal optimum $x_*$ (strong duality holds in this convex problem!), and check that $x_*$ is feasible."
    ]
   },
   {