From e6520b901017ac7ff353d7dee5463684be43498c Mon Sep 17 00:00:00 2001 From: kaylalei <125754765+kaylalei@users.noreply.github.com> Date: Fri, 22 Nov 2024 16:52:59 -0500 Subject: [PATCH] fix(curriculum): Updated `semiPrime` test (#57298) --- .../project-euler-problems-101-to-200/problem-187-semiprimes.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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--