diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
index 7ea4bc51bb..1b4f2b099b 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
@@ -10,12 +10,11 @@ forumTopicId: 301837
At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
-
-What fraction of the area is not covered by circles after 10 iterations?
+What fraction of the area is not covered by circles after `n` iterations?
Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
euler199()
should return 0.00396087.
- testString: assert.strictEqual(euler199(), 0.00396087);
+ - text: iterativeCirclePacking(10)
should return a number.
+ testString: assert(typeof iterativeCirclePacking(10) === 'number');
+ - text: iterativeCirclePacking(10)
should return 0.00396087.
+ testString: assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
+ - text: iterativeCirclePacking(3)
should return 0.06790342.
+ testString: assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
```
@@ -42,12 +45,12 @@ tests: