diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md
index bcd6f324753..1772b8f0196 100644
--- a/curriculum/challenges/english/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md
+++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md
@@ -19,7 +19,7 @@ How many composite integers, $n < {10}^8$, have precisely two, not necessaril
 `semiPrimes()` should return `17427258`.
 
 ```js
-assert.strictEqual(euler187(), 17427258);
+assert.strictEqual(semiPrimes(), 17427258);
 ```
 
 # --seed--