diff --git a/notebooks/problem0060.ipynb b/notebooks/problem0060.ipynb
index fa36047..aa2105c 100644
--- a/notebooks/problem0060.ipynb
+++ b/notebooks/problem0060.ipynb
@@ -73,7 +73,7 @@
    "id": "ab8e7abc",
    "metadata": {},
    "source": [
-    "In the language of graph theory, the problem is to find a [5-clique](https://en.wikipedia.org/wiki/Clique_(graph_theory)) in this graph where the sum of the vertices is minimized. [The problem of finding cliques](https://en.wikipedia.org/wiki/Clique_problem) is hard (i.e. NP-complete) in general, but we can find 5-cliques in our graph in polynomial time by simply iterating through every combination of 5 vertices in the graph and seeing if those vertices form a complete subgraph.\n",
+    "In the language of graph theory, the problem is to find a [5-clique](https://w.wiki/EoNJ) in this graph where the sum of the vertices is minimized. [The problem of finding cliques](https://en.wikipedia.org/wiki/Clique_problem) is hard (i.e. NP-complete) in general, but we can find 5-cliques in our graph in polynomial time by simply iterating through every combination of 5 vertices in the graph and seeing if those vertices form a complete subgraph.\n",
     "\n",
     "Alternatively, SageMath includes an algorithm for finding cliques."
    ]