From 6e40dd2e509b4e88a6360d2ef00ec2e810f72a5f Mon Sep 17 00:00:00 2001
From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>
Date: Fri, 26 Jul 2019 19:45:56 -0700
Subject: [PATCH] fix: removed assert msg argument-6 (#36420)
---
.../problem-439-sum-of-sum-of-divisors.english.md | 2 +-
.../problem-44-pentagon-numbers.english.md | 2 +-
.../problem-440-gcd-and-tiling.english.md | 2 +-
...the-inverse-summation-of-coprime-couples.english.md | 2 +-
.../problem-442-eleven-free-integers.english.md | 2 +-
.../project-euler/problem-443-gcd-sequence.english.md | 2 +-
.../problem-444-the-roundtable-lottery.english.md | 2 +-
.../project-euler/problem-445-retractions-a.english.md | 2 +-
.../project-euler/problem-446-retractions-b.english.md | 2 +-
.../project-euler/problem-447-retractions-c.english.md | 2 +-
...roblem-448-average-least-common-multiple.english.md | 2 +-
.../problem-449-chocolate-covered-candy.english.md | 2 +-
...m-45-triangular-pentagonal-and-hexagonal.english.md | 2 +-
...oblem-450-hypocycloid-and-lattice-points.english.md | 2 +-
.../problem-451-modular-inverses.english.md | 2 +-
.../project-euler/problem-452-long-products.english.md | 2 +-
.../problem-453-lattice-quadrilaterals.english.md | 2 +-
.../problem-454-diophantine-reciprocals-iii.english.md | 2 +-
.../problem-455-powers-with-trailing-digits.english.md | 2 +-
...m-456-triangles-containing-the-origin-ii.english.md | 2 +-
...-polynomial-modulo-the-square-of-a-prime.english.md | 2 +-
.../problem-458-permutations-of-project.english.md | 2 +-
.../project-euler/problem-459-flipping-game.english.md | 2 +-
.../problem-46-goldbachs-other-conjecture.english.md | 2 +-
.../problem-460-an-ant-on-the-move.english.md | 2 +-
.../project-euler/problem-461-almost-pi.english.md | 2 +-
...blem-462-permutation-of-3-smooth-numbers.english.md | 2 +-
.../problem-463-a-weird-recurrence-relation.english.md | 2 +-
...problem-464-mbius-function-and-intervals.english.md | 2 +-
.../problem-465-polar-polygons.english.md | 2 +-
...distinct-terms-in-a-multiplication-table.english.md | 2 +-
.../project-euler/problem-467-superinteger.english.md | 2 +-
...smooth-divisors-of-binomial-coefficients.english.md | 2 +-
.../project-euler/problem-469-empty-chairs.english.md | 2 +-
.../problem-47-distinct-primes-factors.english.md | 6 +++---
.../project-euler/problem-470-super-ramvok.english.md | 2 +-
...roblem-471-triangle-inscribed-in-ellipse.english.md | 2 +-
.../problem-472-comfortable-distance-ii.english.md | 2 +-
.../problem-473-phigital-number-base.english.md | 2 +-
.../problem-474-last-digits-of-divisors.english.md | 2 +-
.../problem-475-music-festival.english.md | 2 +-
.../problem-476-circle-packing-ii.english.md | 2 +-
.../problem-477-number-sequence-game.english.md | 2 +-
.../project-euler/problem-478-mixtures.english.md | 2 +-
.../problem-479-roots-on-the-rise.english.md | 2 +-
.../project-euler/problem-48-self-powers.english.md | 8 ++++----
.../problem-480-the-last-question.english.md | 2 +-
.../problem-49-prime-permutations.english.md | 2 +-
.../problem-5-smallest-multiple.english.md | 10 +++++-----
.../problem-50-consecutive-prime-sum.english.md | 4 ++--
.../problem-51-prime-digit-replacements.english.md | 2 +-
.../problem-52-permuted-multiples.english.md | 2 +-
.../problem-53-combinatoric-selections.english.md | 8 ++++----
.../project-euler/problem-54-poker-hands.english.md | 2 +-
.../problem-55-lychrel-numbers.english.md | 10 +++++-----
.../problem-56-powerful-digit-sum.english.md | 2 +-
.../problem-57-square-root-convergents.english.md | 2 +-
.../project-euler/problem-58-spiral-primes.english.md | 2 +-
.../project-euler/problem-59-xor-decryption.english.md | 2 +-
.../problem-6-sum-square-difference.english.md | 6 +++---
.../problem-60-prime-pair-sets.english.md | 2 +-
.../problem-61-cyclical-figurate-numbers.english.md | 2 +-
.../problem-62-cubic-permutations.english.md | 2 +-
.../problem-63-powerful-digit-counts.english.md | 2 +-
.../problem-64-odd-period-square-roots.english.md | 2 +-
.../problem-65-convergents-of-e.english.md | 2 +-
.../problem-66-diophantine-equation.english.md | 2 +-
.../problem-67-maximum-path-sum-ii.english.md | 2 +-
.../problem-68-magic-5-gon-ring.english.md | 2 +-
.../problem-69-totient-maximum.english.md | 2 +-
.../project-euler/problem-7-10001st-prime.english.md | 10 +++++-----
.../problem-70-totient-permutation.english.md | 2 +-
.../problem-71-ordered-fractions.english.md | 2 +-
.../problem-72-counting-fractions.english.md | 2 +-
...problem-73-counting-fractions-in-a-range.english.md | 2 +-
75 files changed, 98 insertions(+), 98 deletions(-)
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.english.md
index 9d5687a917..3676140481 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.english.md
@@ -25,7 +25,7 @@ Find S(1011) mod 109.
```yml
tests:
- text: euler439() should return 968697378.
- testString: assert.strictEqual(euler439(), 968697378, 'euler439() should return 968697378.');
+ testString: assert.strictEqual(euler439(), 968697378);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-44-pentagon-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-44-pentagon-numbers.english.md
index 93b2a8d03e..8b33a975b2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-44-pentagon-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-44-pentagon-numbers.english.md
@@ -23,7 +23,7 @@ Find the pair of pentagonal numbers, Pj and Pk, for which
```yml
tests:
- text: pentagonNumbers() should return 5482660.
- testString: assert.strictEqual(pentagonNumbers(), 5482660, 'pentagonNumbers() should return 5482660.');
+ testString: assert.strictEqual(pentagonNumbers(), 5482660);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.english.md
index 268fdd3c4e..a8b4afe84b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.english.md
@@ -34,7 +34,7 @@ Find S(2000) mod 987 898 789.
```yml
tests:
- text: euler440() should return 970746056.
- testString: assert.strictEqual(euler440(), 970746056, 'euler440() should return 970746056.');
+ testString: assert.strictEqual(euler440(), 970746056);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.english.md
index 5cf1dc0598..3970c583d8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.english.md
@@ -30,7 +30,7 @@ Find S(107). Give your answer rounded to four decimal places.
```yml
tests:
- text: euler441() should return 5000088.8395.
- testString: assert.strictEqual(euler441(), 5000088.8395, 'euler441() should return 5000088.8395.');
+ testString: assert.strictEqual(euler441(), 5000088.8395);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-442-eleven-free-integers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-442-eleven-free-integers.english.md
index ecb3051188..2c3719c0c5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-442-eleven-free-integers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-442-eleven-free-integers.english.md
@@ -26,7 +26,7 @@ Find E(1018).
```yml
tests:
- text: euler442() should return 1295552661530920200.
- testString: assert.strictEqual(euler442(), 1295552661530920200, 'euler442() should return 1295552661530920200.');
+ testString: assert.strictEqual(euler442(), 1295552661530920200);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-443-gcd-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-443-gcd-sequence.english.md
index 8646344a11..c7ceabb1e5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-443-gcd-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-443-gcd-sequence.english.md
@@ -33,7 +33,7 @@ Find g(1015).
```yml
tests:
- text: euler443() should return 2744233049300770.
- testString: assert.strictEqual(euler443(), 2744233049300770, 'euler443() should return 2744233049300770.');
+ testString: assert.strictEqual(euler443(), 2744233049300770);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.english.md
index f06b233c15..4fd740d9cb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.english.md
@@ -36,7 +36,7 @@ Find S20(1014) and write the answer in scientific notation rounded to 10 signifi
```yml
tests:
- text: euler444() should return 1.200856722e+263.
- testString: assert.strictEqual(euler444(), 1.200856722e+263, 'euler444() should return 1.200856722e+263.');
+ testString: assert.strictEqual(euler444(), 1.200856722e+263);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-445-retractions-a.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-445-retractions-a.english.md
index debebab586..c86fb9a4f8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-445-retractions-a.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-445-retractions-a.english.md
@@ -31,7 +31,7 @@ Give your answer modulo 1 000 000 007.
```yml
tests:
- text: euler445() should return 659104042.
- testString: assert.strictEqual(euler445(), 659104042, 'euler445() should return 659104042.');
+ testString: assert.strictEqual(euler445(), 659104042);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-446-retractions-b.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-446-retractions-b.english.md
index b632177e75..3f5a498ad7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-446-retractions-b.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-446-retractions-b.english.md
@@ -29,7 +29,7 @@ Find F(107) (mod 1 000 000 007)
```yml
tests:
- text: euler446() should return 907803852.
- testString: assert.strictEqual(euler446(), 907803852, 'euler446() should return 907803852.');
+ testString: assert.strictEqual(euler446(), 907803852);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-447-retractions-c.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-447-retractions-c.english.md
index 479cf443c4..15fc75a131 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-447-retractions-c.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-447-retractions-c.english.md
@@ -30,7 +30,7 @@ Find F(1014) (mod 1 000 000 007).
```yml
tests:
- text: euler447() should return 530553372.
- testString: assert.strictEqual(euler447(), 530553372, 'euler447() should return 530553372.');
+ testString: assert.strictEqual(euler447(), 530553372);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.english.md
index aec7eeef6e..ab52f558d5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.english.md
@@ -28,7 +28,7 @@ Find S(99999999019) mod 999999017.
```yml
tests:
- text: euler448() should return 106467648.
- testString: assert.strictEqual(euler448(), 106467648, 'euler448() should return 106467648.');
+ testString: assert.strictEqual(euler448(), 106467648);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.english.md
index 7caa10c9dd..2ec557f6ca 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.english.md
@@ -34,7 +34,7 @@ Find the amount of chocolate in mm3 required if a=3 mm and b=1 mm. Give your ans
```yml
tests:
- text: euler449() should return 103.37870096.
- testString: assert.strictEqual(euler449(), 103.37870096, 'euler449() should return 103.37870096.');
+ testString: assert.strictEqual(euler449(), 103.37870096);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.english.md
index a5c81dfb32..4c3a91e198 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.english.md
@@ -25,7 +25,7 @@ Find the next triangle number that is also pentagonal and hexagonal.
```yml
tests:
- text: triPentaHexa(40756) should return 1533776805.
- testString: assert.strictEqual(triPentaHexa(40756), 1533776805, 'triPentaHexa(40756) should return 1533776805.');
+ testString: assert.strictEqual(triPentaHexa(40756), 1533776805);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.english.md
index ace2020107..83eb575eaf 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.english.md
@@ -48,7 +48,7 @@ Find T(106).
```yml
tests:
- text: euler450() should return 583333163984220900.
- testString: assert.strictEqual(euler450(), 583333163984220900, 'euler450() should return 583333163984220900.');
+ testString: assert.strictEqual(euler450(), 583333163984220900);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-451-modular-inverses.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-451-modular-inverses.english.md
index 6c9d431478..bf1acf9f7c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-451-modular-inverses.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-451-modular-inverses.english.md
@@ -35,7 +35,7 @@ Find ∑I(n) for 3≤n≤2·107
```yml
tests:
- text: euler451() should return 153651073760956.
- testString: assert.strictEqual(euler451(), 153651073760956, 'euler451() should return 153651073760956.');
+ testString: assert.strictEqual(euler451(), 153651073760956);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-452-long-products.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-452-long-products.english.md
index 7d43be2a0d..16d0192db0 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-452-long-products.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-452-long-products.english.md
@@ -23,7 +23,7 @@ Find F(109, 109) mod 1 234 567 891.
```yml
tests:
- text: euler452() should return 345558983.
- testString: assert.strictEqual(euler452(), 345558983, 'euler452() should return 345558983.');
+ testString: assert.strictEqual(euler452(), 345558983);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.english.md
index 660e02f791..bf2673b7a3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.english.md
@@ -28,7 +28,7 @@ Find Q(12345, 6789) mod 135707531.
```yml
tests:
- text: euler453() should return 104354107.
- testString: assert.strictEqual(euler453(), 104354107, 'euler453() should return 104354107.');
+ testString: assert.strictEqual(euler453(), 104354107);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.english.md
index 5fc5489b94..59a4f910d9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.english.md
@@ -28,7 +28,7 @@ Find F(1012).
```yml
tests:
- text: euler454() should return 5435004633092.
- testString: assert.strictEqual(euler454(), 5435004633092, 'euler454() should return 5435004633092.');
+ testString: assert.strictEqual(euler454(), 5435004633092);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.english.md
index 8ecd9f330c..cfeb3c63c8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.english.md
@@ -28,7 +28,7 @@ Find Σf(n), 2 ≤ n ≤ 106.
```yml
tests:
- text: euler455() should return 450186511399999.
- testString: assert.strictEqual(euler455(), 450186511399999, 'euler455() should return 450186511399999.');
+ testString: assert.strictEqual(euler455(), 450186511399999);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.english.md
index 62a952eea8..0e7d500136 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.english.md
@@ -35,7 +35,7 @@ Find C(2 000 000).
```yml
tests:
- text: euler456() should return 333333208685971500.
- testString: assert.strictEqual(euler456(), 333333208685971500, 'euler456() should return 333333208685971500.');
+ testString: assert.strictEqual(euler456(), 333333208685971500);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.english.md
index 92269bd84e..245f7930a3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.english.md
@@ -28,7 +28,7 @@ Find SR(107).
```yml
tests:
- text: euler457() should return 2647787126797397000.
- testString: assert.strictEqual(euler457(), 2647787126797397000, 'euler457() should return 2647787126797397000.');
+ testString: assert.strictEqual(euler457(), 2647787126797397000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-458-permutations-of-project.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-458-permutations-of-project.english.md
index 614356c092..5fbba646ad 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-458-permutations-of-project.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-458-permutations-of-project.english.md
@@ -26,7 +26,7 @@ Find T(1012). Give the last 9 digits of your answer.
```yml
tests:
- text: euler458() should return 423341841.
- testString: assert.strictEqual(euler458(), 423341841, 'euler458() should return 423341841.');
+ testString: assert.strictEqual(euler458(), 423341841);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-459-flipping-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-459-flipping-game.english.md
index e75ea50fcc..9d1fa393ef 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-459-flipping-game.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-459-flipping-game.english.md
@@ -40,7 +40,7 @@ Find W(106).
```yml
tests:
- text: euler459() should return 3996390106631.
- testString: assert.strictEqual(euler459(), 3996390106631, 'euler459() should return 3996390106631.');
+ testString: assert.strictEqual(euler459(), 3996390106631);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.english.md
index 1b8bc8e8bf..27898e0a4d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.english.md
@@ -28,7 +28,7 @@ What is the smallest odd composite that cannot be written as the sum of a prime
```yml
tests:
- text: goldbachsOtherConjecture() should return 5777.
- testString: assert.strictEqual(goldbachsOtherConjecture(), 5777, 'goldbachsOtherConjecture() should return 5777.');
+ testString: assert.strictEqual(goldbachsOtherConjecture(), 5777);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.english.md
index 659a53838d..881704d064 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.english.md
@@ -40,7 +40,7 @@ Find F(10000). Give your answer rounded to nine decimal places.
```yml
tests:
- text: euler460() should return 18.420738199.
- testString: assert.strictEqual(euler460(), 18.420738199, 'euler460() should return 18.420738199.');
+ testString: assert.strictEqual(euler460(), 18.420738199);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-461-almost-pi.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-461-almost-pi.english.md
index 469944a3de..13ad338309 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-461-almost-pi.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-461-almost-pi.english.md
@@ -26,7 +26,7 @@ Find g(10000).
```yml
tests:
- text: euler461() should return 159820276.
- testString: assert.strictEqual(euler461(), 159820276, 'euler461() should return 159820276.');
+ testString: assert.strictEqual(euler461(), 159820276);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.english.md
index f76628237f..530ca2fe6c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.english.md
@@ -38,7 +38,7 @@ When giving your answer, use a lowercase e to separate mantissa and exponent. E.
```yml
tests:
- text: euler462() should return Infinity.
- testString: assert.strictEqual(euler462(), Infinity, 'euler462() should return Infinity.');
+ testString: assert.strictEqual(euler462(), Infinity);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.english.md
index e4c51ce880..49af0c5d19 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.english.md
@@ -29,7 +29,7 @@ Find $S(3^{37})$. Give the last 9 digits of your answer.
```yml
tests:
- text: euler463() should return 808981553.
- testString: assert.strictEqual(euler463(), 808981553, 'euler463() should return 808981553.');
+ testString: assert.strictEqual(euler463(), 808981553);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.english.md
index 6a560af9d1..b69a382d2b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.english.md
@@ -39,7 +39,7 @@ Find C(20 000 000).
```yml
tests:
- text: euler464() should return 198775297232878.
- testString: assert.strictEqual(euler464(), 198775297232878, 'euler464() should return 198775297232878.');
+ testString: assert.strictEqual(euler464(), 198775297232878);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-465-polar-polygons.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-465-polar-polygons.english.md
index aaadf853c4..c09139cb48 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-465-polar-polygons.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-465-polar-polygons.english.md
@@ -36,7 +36,7 @@ Find P(713) mod 1 000 000 007.
```yml
tests:
- text: euler465() should return 585965659.
- testString: assert.strictEqual(euler465(), 585965659, 'euler465() should return 585965659.');
+ testString: assert.strictEqual(euler465(), 585965659);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.english.md
index 4dc76cbd4a..657d171043 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.english.md
@@ -35,7 +35,7 @@ Find P(64,1016).
```yml
tests:
- text: euler466() should return 258381958195474750.
- testString: assert.strictEqual(euler466(), 258381958195474750, 'euler466() should return 258381958195474750.');
+ testString: assert.strictEqual(euler466(), 258381958195474750);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-467-superinteger.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-467-superinteger.english.md
index b0e01ef742..d8195ce1c9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-467-superinteger.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-467-superinteger.english.md
@@ -38,7 +38,7 @@ Find f(10 000) mod 1 000 000 007.
```yml
tests:
- text: euler467() should return 775181359.
- testString: assert.strictEqual(euler467(), 775181359, 'euler467() should return 775181359.');
+ testString: assert.strictEqual(euler467(), 775181359);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.english.md
index 1315144d7d..a3efd4e7d3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.english.md
@@ -34,7 +34,7 @@ Find F(11 111 111) mod 1 000 000 993.
```yml
tests:
- text: euler468() should return 852950321.
- testString: assert.strictEqual(euler468(), 852950321, 'euler468() should return 852950321.');
+ testString: assert.strictEqual(euler468(), 852950321);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-469-empty-chairs.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-469-empty-chairs.english.md
index d8b076aeb2..addd3c3e9e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-469-empty-chairs.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-469-empty-chairs.english.md
@@ -30,7 +30,7 @@ Find E(1018). Give your answer rounded to fourteen decimal places in the form 0.
```yml
tests:
- text: euler469() should return 0.56766764161831.
- testString: assert.strictEqual(euler469(), 0.56766764161831, 'euler469() should return 0.56766764161831.');
+ testString: assert.strictEqual(euler469(), 0.56766764161831);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.english.md
index ea8001e168..de1546706e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.english.md
@@ -27,11 +27,11 @@ Find the first four consecutive integers to have four distinct prime factors eac
```yml
tests:
- text: distinctPrimeFactors(2, 2) should return 14.
- testString: assert.strictEqual(distinctPrimeFactors(2, 2), 14, 'distinctPrimeFactors(2, 2) should return 14.');
+ testString: assert.strictEqual(distinctPrimeFactors(2, 2), 14);
- text: distinctPrimeFactors(3, 3) should return 644.
- testString: assert.strictEqual(distinctPrimeFactors(3, 3), 644, 'distinctPrimeFactors(3, 3) should return 644.');
+ testString: assert.strictEqual(distinctPrimeFactors(3, 3), 644);
- text: distinctPrimeFactors(4, 4) should return 134043.
- testString: assert.strictEqual(distinctPrimeFactors(4, 4), 134043, 'distinctPrimeFactors(4, 4) should return 134043.');
+ testString: assert.strictEqual(distinctPrimeFactors(4, 4), 134043);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-470-super-ramvok.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-470-super-ramvok.english.md
index 43f9ea94a6..a79bb4be9c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-470-super-ramvok.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-470-super-ramvok.english.md
@@ -32,7 +32,7 @@ Calculate F(20), rounded to the nearest integer.
```yml
tests:
- text: euler470() should return 147668794.
- testString: assert.strictEqual(euler470(), 147668794, 'euler470() should return 147668794.');
+ testString: assert.strictEqual(euler470(), 147668794);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.english.md
index d0c9ff130d..90e0c7c208 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.english.md
@@ -29,7 +29,7 @@ For G(10) the answer would have been 2.059722222e1.
```yml
tests:
- text: euler471() should return 1.895093981e+31.
- testString: assert.strictEqual(euler471(), 1.895093981e+31, 'euler471() should return 1.895093981e+31.');
+ testString: assert.strictEqual(euler471(), 1.895093981e+31);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.english.md
index 7d16fce9d8..0fbf4b1672 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.english.md
@@ -37,7 +37,7 @@ Find ∑f(N) for 1 ≤ N ≤ 1012. Give the last 8 digits of your answer.
```yml
tests:
- text: euler472() should return 73811586.
- testString: assert.strictEqual(euler472(), 73811586, 'euler472() should return 73811586.');
+ testString: assert.strictEqual(euler472(), 73811586);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-473-phigital-number-base.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-473-phigital-number-base.english.md
index 5a89b81a45..3aa0548e89 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-473-phigital-number-base.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-473-phigital-number-base.english.md
@@ -37,7 +37,7 @@ Find the sum of the positive integers not exceeding $10^{10}$ whose phigital rep
```yml
tests:
- text: euler473() should return 35856681704365.
- testString: assert.strictEqual(euler473(), 35856681704365, 'euler473() should return 35856681704365.');
+ testString: assert.strictEqual(euler473(), 35856681704365);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.english.md
index 442129f072..5913ff6666 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.english.md
@@ -27,7 +27,7 @@ Find F(106!, 65432) modulo (1016 + 61).
```yml
tests:
- text: euler474() should return 9690646731515010.
- testString: assert.strictEqual(euler474(), 9690646731515010, 'euler474() should return 9690646731515010.');
+ testString: assert.strictEqual(euler474(), 9690646731515010);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-475-music-festival.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-475-music-festival.english.md
index b6aef77ae2..51803cab30 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-475-music-festival.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-475-music-festival.english.md
@@ -27,7 +27,7 @@ Find f(600) mod 1 000 000 007.
```yml
tests:
- text: euler475() should return 75780067.
- testString: assert.strictEqual(euler475(), 75780067, 'euler475() should return 75780067.');
+ testString: assert.strictEqual(euler475(), 75780067);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-476-circle-packing-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-476-circle-packing-ii.english.md
index a49b152beb..3a5d4fc781 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-476-circle-packing-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-476-circle-packing-ii.english.md
@@ -23,7 +23,7 @@ Find S(1803) rounded to 5 decimal places behind the decimal point.
```yml
tests:
- text: euler476() should return 110242.87794.
- testString: assert.strictEqual(euler476(), 110242.87794, 'euler476() should return 110242.87794.');
+ testString: assert.strictEqual(euler476(), 110242.87794);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-477-number-sequence-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-477-number-sequence-game.english.md
index c4cb138daf..1e80ac1159 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-477-number-sequence-game.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-477-number-sequence-game.english.md
@@ -34,7 +34,7 @@ Find F(108).
```yml
tests:
- text: euler477() should return 25044905874565164.
- testString: assert.strictEqual(euler477(), 25044905874565164, 'euler477() should return 25044905874565164.');
+ testString: assert.strictEqual(euler477(), 25044905874565164);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-478-mixtures.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-478-mixtures.english.md
index ebc10bef99..ec3fed2a70 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-478-mixtures.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-478-mixtures.english.md
@@ -40,7 +40,7 @@ Find E(10 000 000) mod 118.
```yml
tests:
- text: euler478() should return 59510340.
- testString: assert.strictEqual(euler478(), 59510340, 'euler478() should return 59510340.');
+ testString: assert.strictEqual(euler478(), 59510340);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.english.md
index c0d3911bcb..4f3276dd48 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.english.md
@@ -28,7 +28,7 @@ Find S(106) modulo 1 000 000 007.
```yml
tests:
- text: euler479() should return 191541795.
- testString: assert.strictEqual(euler479(), 191541795, 'euler479() should return 191541795.');
+ testString: assert.strictEqual(euler479(), 191541795);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-48-self-powers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-48-self-powers.english.md
index f258821dbf..b9eaf46741 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-48-self-powers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-48-self-powers.english.md
@@ -21,13 +21,13 @@ Find the last ten digits of the series, 11 + 22 + 33<
```yml
tests:
- text: selfPowers(10, 3) should return 317.
- testString: assert.strictEqual(selfPowers(10, 3), 317, 'selfPowers(10, 3) should return 317.');
+ testString: assert.strictEqual(selfPowers(10, 3), 317);
- text: selfPowers(150, 6) should return 29045.
- testString: assert.strictEqual(selfPowers(150, 6), 29045, 'selfPowers(150, 6) should return 29045.');
+ testString: assert.strictEqual(selfPowers(150, 6), 29045);
- text: selfPowers(673, 7) should return 2473989.
- testString: assert.strictEqual(selfPowers(673, 7), 2473989, 'selfPowers(673, 7) should return 2473989.');
+ testString: assert.strictEqual(selfPowers(673, 7), 2473989);
- text: selfPowers(1000, 10) should return 9110846700.
- testString: assert.strictEqual(selfPowers(1000, 10), 9110846700, 'selfPowers(1000, 10) should return 9110846700.');
+ testString: assert.strictEqual(selfPowers(1000, 10), 9110846700);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-480-the-last-question.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-480-the-last-question.english.md
index 76c435730d..8669f77e2f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-480-the-last-question.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-480-the-last-question.english.md
@@ -58,7 +58,7 @@ Give your answer using lowercase characters (no punctuation or space).
```yml
tests:
- text: euler480() should return turnthestarson.
- testString: assert.strictEqual(euler480(), turnthestarson, 'euler480() should return turnthestarson.');
+ testString: assert.strictEqual(euler480(), turnthestarson);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-49-prime-permutations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-49-prime-permutations.english.md
index 42440cbdee..7d14ec5672 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-49-prime-permutations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-49-prime-permutations.english.md
@@ -22,7 +22,7 @@ What 12-digit number do you form by concatenating the three terms in this sequen
```yml
tests:
- text: primePermutations() should return 296962999629.
- testString: assert.strictEqual(primePermutations(), 296962999629, 'primePermutations() should return 296962999629.');
+ testString: assert.strictEqual(primePermutations(), 296962999629);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-5-smallest-multiple.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-5-smallest-multiple.english.md
index b2afb36dda..3bfbe1d4dc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-5-smallest-multiple.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-5-smallest-multiple.english.md
@@ -21,15 +21,15 @@ What is the smallest positive number that is evenly divisible by all of the numb
```yml
tests:
- text: smallestMult(5) should return 60.
- testString: assert.strictEqual(smallestMult(5), 60, 'smallestMult(5) should return 60.');
+ testString: assert.strictEqual(smallestMult(5), 60);
- text: smallestMult(7) should return 420.
- testString: assert.strictEqual(smallestMult(7), 420, 'smallestMult(7) should return 420.');
+ testString: assert.strictEqual(smallestMult(7), 420);
- text: smallestMult(10) should return 2520.
- testString: assert.strictEqual(smallestMult(10), 2520, 'smallestMult(10) should return 2520.');
+ testString: assert.strictEqual(smallestMult(10), 2520);
- text: smallestMult(13) should return 360360.
- testString: assert.strictEqual(smallestMult(13), 360360, 'smallestMult(13) should return 360360.');
+ testString: assert.strictEqual(smallestMult(13), 360360);
- text: smallestMult(20) should return 232792560.
- testString: assert.strictEqual(smallestMult(20), 232792560, 'smallestMult(20) should return 232792560.');
+ testString: assert.strictEqual(smallestMult(20), 232792560);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.english.md
index 09fc3cfb24..0435dc64c7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.english.md
@@ -24,9 +24,9 @@ Which prime, below one-million, can be written as the sum of the most consecutiv
```yml
tests:
- text: consecutivePrimeSum(1000) should return 953.
- testString: assert.strictEqual(consecutivePrimeSum(1000), 953, 'consecutivePrimeSum(1000) should return 953.');
+ testString: assert.strictEqual(consecutivePrimeSum(1000), 953);
- text: consecutivePrimeSum(1000000) should return 997651.
- testString: assert.strictEqual(consecutivePrimeSum(1000000), 997651, 'consecutivePrimeSum(1000000) should return 997651.');
+ testString: assert.strictEqual(consecutivePrimeSum(1000000), 997651);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.english.md
index d3de5afc49..c34a4f0e7f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.english.md
@@ -22,7 +22,7 @@ Find the smallest prime which, by replacing part of the number (not necessarily
```yml
tests:
- text: euler51() should return 121313.
- testString: assert.strictEqual(euler51(), 121313, 'euler51() should return 121313.');
+ testString: assert.strictEqual(euler51(), 121313);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-52-permuted-multiples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-52-permuted-multiples.english.md
index 704283c032..c2a22ef8bd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-52-permuted-multiples.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-52-permuted-multiples.english.md
@@ -21,7 +21,7 @@ Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain
```yml
tests:
- text: permutedMultiples() should return 142857.
- testString: assert.strictEqual(permutedMultiples(), 142857, 'permutedMultiples() should return 142857.');
+ testString: assert.strictEqual(permutedMultiples(), 142857);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-53-combinatoric-selections.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-53-combinatoric-selections.english.md
index da3976cde8..1f059c4dc5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-53-combinatoric-selections.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-53-combinatoric-selections.english.md
@@ -30,13 +30,13 @@ How many, not necessarily distinct, values of nCr, for 1 ≤ n ≤ 100, are gr
```yml
tests:
- text: combinatoricSelections(1000) should return 4626.
- testString: assert.strictEqual(combinatoricSelections(1000), 4626, 'combinatoricSelections(1000) should return 4626.');
+ testString: assert.strictEqual(combinatoricSelections(1000), 4626);
- text: combinatoricSelections(10000) should return 4431.
- testString: assert.strictEqual(combinatoricSelections(10000), 4431, 'combinatoricSelections(10000) should return 4431.');
+ testString: assert.strictEqual(combinatoricSelections(10000), 4431);
- text: combinatoricSelections(100000) should return 4255.
- testString: assert.strictEqual(combinatoricSelections(100000), 4255, 'combinatoricSelections(100000) should return 4255.');
+ testString: assert.strictEqual(combinatoricSelections(100000), 4255);
- text: combinatoricSelections(1000000) should return 4075.
- testString: assert.strictEqual(combinatoricSelections(1000000), 4075, 'combinatoricSelections(1000000) should return 4075.');
+ testString: assert.strictEqual(combinatoricSelections(1000000), 4075);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-54-poker-hands.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-54-poker-hands.english.md
index 3b7962c155..aed8f63151 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-54-poker-hands.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-54-poker-hands.english.md
@@ -43,7 +43,7 @@ How many hands does Player 1 win?
```yml
tests:
- text: euler54() should return 376.
- testString: assert.strictEqual(euler54(), 376, 'euler54() should return 376.');
+ testString: assert.strictEqual(euler54(), 376);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-55-lychrel-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-55-lychrel-numbers.english.md
index 8e22eaf514..3dc42be977 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-55-lychrel-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-55-lychrel-numbers.english.md
@@ -29,15 +29,15 @@ NOTE: Wording was modified slightly on 24 April 2007 to emphasise the theoretica
```yml
tests:
- text: countLychrelNumbers(1000) should return 13.
- testString: assert.strictEqual(countLychrelNumbers(1000), 13, 'countLychrelNumbers(1000) should return 13.');
+ testString: assert.strictEqual(countLychrelNumbers(1000), 13);
- text: countLychrelNumbers(5000) should return 76.
- testString: assert.strictEqual(countLychrelNumbers(5000), 76, 'countLychrelNumbers(5000) should return 76.');
+ testString: assert.strictEqual(countLychrelNumbers(5000), 76);
- text: countLychrelNumbers(10000) should return 249.
- testString: assert.strictEqual(countLychrelNumbers(10000), 249, 'countLychrelNumbers(10000) should return 249.');
+ testString: assert.strictEqual(countLychrelNumbers(10000), 249);
- text: Your function should count all Lychrel numbers.
- testString: assert.strictEqual(countLychrelNumbers(3243), 39, 'Your function should count all Lychrel numbers.');
+ testString: assert.strictEqual(countLychrelNumbers(3243), 39);
- text: Your function should pass all test cases.
- testString: assert.strictEqual(countLychrelNumbers(7654), 140, 'Your function should pass all test cases.');
+ testString: assert.strictEqual(countLychrelNumbers(7654), 140);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.english.md
index def0c10ab3..6c4d657120 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.english.md
@@ -21,7 +21,7 @@ Considering natural numbers of the form, ab, where a, b < 100, what is the maxim
```yml
tests:
- text: euler56() should return 972.
- testString: assert.strictEqual(euler56(), 972, 'euler56() should return 972.');
+ testString: assert.strictEqual(euler56(), 972);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-57-square-root-convergents.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-57-square-root-convergents.english.md
index 2d7c3b1eac..22068324d7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-57-square-root-convergents.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-57-square-root-convergents.english.md
@@ -28,7 +28,7 @@ In the first one-thousand expansions, how many fractions contain a numerator wit
```yml
tests:
- text: euler57() should return 153.
- testString: assert.strictEqual(euler57(), 153, 'euler57() should return 153.');
+ testString: assert.strictEqual(euler57(), 153);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-58-spiral-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-58-spiral-primes.english.md
index fc5b583e2d..256f29766e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-58-spiral-primes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-58-spiral-primes.english.md
@@ -28,7 +28,7 @@ If one complete new layer is wrapped around the spiral above, a square spiral wi
```yml
tests:
- text: euler58() should return 26241.
- testString: assert.strictEqual(euler58(), 26241, 'euler58() should return 26241.');
+ testString: assert.strictEqual(euler58(), 26241);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-59-xor-decryption.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-59-xor-decryption.english.md
index 615467eca3..f8f92995f9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-59-xor-decryption.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-59-xor-decryption.english.md
@@ -24,7 +24,7 @@ Your task has been made easy, as the encryption key consists of three lower case
```yml
tests:
- text: euler59() should return 107359.
- testString: assert.strictEqual(euler59(), 107359, 'euler59() should return 107359.');
+ testString: assert.strictEqual(euler59(), 107359);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-6-sum-square-difference.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-6-sum-square-difference.english.md
index 96d774a826..29b3b7c684 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-6-sum-square-difference.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-6-sum-square-difference.english.md
@@ -25,11 +25,11 @@ Find the difference between the sum of the squares of the first n n
```yml
tests:
- text: sumSquareDifference(10) should return 2640.
- testString: assert.strictEqual(sumSquareDifference(10), 2640, 'sumSquareDifference(10) should return 2640.');
+ testString: assert.strictEqual(sumSquareDifference(10), 2640);
- text: sumSquareDifference(20) should return 41230.
- testString: assert.strictEqual(sumSquareDifference(20), 41230, 'sumSquareDifference(20) should return 41230.');
+ testString: assert.strictEqual(sumSquareDifference(20), 41230);
- text: sumSquareDifference(100) should return 25164150.
- testString: assert.strictEqual(sumSquareDifference(100), 25164150, 'sumSquareDifference(100) should return 25164150.');
+ testString: assert.strictEqual(sumSquareDifference(100), 25164150);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-60-prime-pair-sets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-60-prime-pair-sets.english.md
index 1e1cd4358a..5aed0c3864 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-60-prime-pair-sets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-60-prime-pair-sets.english.md
@@ -21,7 +21,7 @@ Find the lowest sum for a set of five primes for which any two primes concatenat
```yml
tests:
- text: euler60() should return 26033.
- testString: assert.strictEqual(euler60(), 26033, 'euler60() should return 26033.');
+ testString: assert.strictEqual(euler60(), 26033);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.english.md
index dc69bd8de8..09728ab8af 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.english.md
@@ -55,7 +55,7 @@ Find the sum of the only ordered set of six cyclic 4-digit numbers for which eac
```yml
tests:
- text: euler61() should return 28684.
- testString: assert.strictEqual(euler61(), 28684, 'euler61() should return 28684.');
+ testString: assert.strictEqual(euler61(), 28684);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-62-cubic-permutations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-62-cubic-permutations.english.md
index 9de32b619b..b8f998b739 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-62-cubic-permutations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-62-cubic-permutations.english.md
@@ -21,7 +21,7 @@ Find the smallest cube for which exactly five permutations of its digits are cub
```yml
tests:
- text: euler62() should return 127035954683.
- testString: assert.strictEqual(euler62(), 127035954683, 'euler62() should return 127035954683.');
+ testString: assert.strictEqual(euler62(), 127035954683);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md
index 582d0440c6..d82b41623a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md
@@ -21,7 +21,7 @@ How many n-digit positive integers exist which are also an nth power?
```yml
tests:
- text: euler63() should return 49.
- testString: assert.strictEqual(euler63(), 49, 'euler63() should return 49.');
+ testString: assert.strictEqual(euler63(), 49);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.english.md
index f86d2553fb..e271aa8108 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.english.md
@@ -143,7 +143,7 @@ How many continued fractions for N ≤ 10000 have an odd period?
```yml
tests:
- text: euler64() should return 1322.
- testString: assert.strictEqual(euler64(), 1322, 'euler64() should return 1322.');
+ testString: assert.strictEqual(euler64(), 1322);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-65-convergents-of-e.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-65-convergents-of-e.english.md
index 15f87b44f1..2d55a99317 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-65-convergents-of-e.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-65-convergents-of-e.english.md
@@ -109,7 +109,7 @@ Find the sum of digits in the numerator of the 100th convergent of the continued
```yml
tests:
- text: euler65() should return 272.
- testString: assert.strictEqual(euler65(), 272, 'euler65() should return 272.');
+ testString: assert.strictEqual(euler65(), 272);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-66-diophantine-equation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-66-diophantine-equation.english.md
index 1197b0b83f..cf7a0c89ce 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-66-diophantine-equation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-66-diophantine-equation.english.md
@@ -30,7 +30,7 @@ Find the value of D ≤ 1000 in minimal solutions of x for which the largest val
```yml
tests:
- text: euler66() should return 661.
- testString: assert.strictEqual(euler66(), 661, 'euler66() should return 661.');
+ testString: assert.strictEqual(euler66(), 661);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.english.md
index f8e4b8b597..dd5e6d731e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.english.md
@@ -26,7 +26,7 @@ NOTE: This is a much more difficult version of Problem 18. It is not possible to
```yml
tests:
- text: euler67() should return 7273.
- testString: assert.strictEqual(euler67(), 7273, 'euler67() should return 7273.');
+ testString: assert.strictEqual(euler67(), 7273);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.english.md
index adb198edde..bc417cb22b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.english.md
@@ -37,7 +37,7 @@ Using the numbers 1 to 10, and depending on arrangements, it is possible to form
```yml
tests:
- text: euler68() should return 6531031914842725.
- testString: assert.strictEqual(euler68(), 6531031914842725, 'euler68() should return 6531031914842725.');
+ testString: assert.strictEqual(euler68(), 6531031914842725);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-69-totient-maximum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-69-totient-maximum.english.md
index 3239858a63..b68c589038 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-69-totient-maximum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-69-totient-maximum.english.md
@@ -64,7 +64,7 @@ Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.
```yml
tests:
- text: euler69() should return 510510.
- testString: assert.strictEqual(euler69(), 510510, 'euler69() should return 510510.');
+ testString: assert.strictEqual(euler69(), 510510);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-7-10001st-prime.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-7-10001st-prime.english.md
index 5a08ae5645..8ba83d637d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-7-10001st-prime.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-7-10001st-prime.english.md
@@ -21,15 +21,15 @@ What is the nth prime number?
```yml
tests:
- text: nthPrime(6) should return 13.
- testString: assert.strictEqual(nthPrime(6), 13, 'nthPrime(6) should return 13.');
+ testString: assert.strictEqual(nthPrime(6), 13);
- text: nthPrime(10) should return 29.
- testString: assert.strictEqual(nthPrime(10), 29, 'nthPrime(10) should return 29.');
+ testString: assert.strictEqual(nthPrime(10), 29);
- text: nthPrime(100) should return 541.
- testString: assert.strictEqual(nthPrime(100), 541, 'nthPrime(100) should return 541.');
+ testString: assert.strictEqual(nthPrime(100), 541);
- text: nthPrime(1000) should return 7919.
- testString: assert.strictEqual(nthPrime(1000), 7919, 'nthPrime(1000) should return 7919.');
+ testString: assert.strictEqual(nthPrime(1000), 7919);
- text: nthPrime(10001) should return 104743.
- testString: assert.strictEqual(nthPrime(10001), 104743, 'nthPrime(10001) should return 104743.');
+ testString: assert.strictEqual(nthPrime(10001), 104743);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-70-totient-permutation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-70-totient-permutation.english.md
index d724a73355..478bced09a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-70-totient-permutation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-70-totient-permutation.english.md
@@ -22,7 +22,7 @@ Find the value of n, 1 < n < 107, for which φ(n) is a permutation of n and the
```yml
tests:
- text: euler70() should return 8319823.
- testString: assert.strictEqual(euler70(), 8319823, 'euler70() should return 8319823.');
+ testString: assert.strictEqual(euler70(), 8319823);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-71-ordered-fractions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-71-ordered-fractions.english.md
index 48e1dbdf0c..634a4ce680 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-71-ordered-fractions.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-71-ordered-fractions.english.md
@@ -24,7 +24,7 @@ By listing the set of reduced proper fractions for d ≤ 1,000,000 in ascending
```yml
tests:
- text: euler71() should return 428570.
- testString: assert.strictEqual(euler71(), 428570, 'euler71() should return 428570.');
+ testString: assert.strictEqual(euler71(), 428570);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-72-counting-fractions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-72-counting-fractions.english.md
index 4fc97b9b71..46bce2f483 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-72-counting-fractions.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-72-counting-fractions.english.md
@@ -24,7 +24,7 @@ How many elements would be contained in the set of reduced proper fractions for
```yml
tests:
- text: euler72() should return 303963552391.
- testString: assert.strictEqual(euler72(), 303963552391, 'euler72() should return 303963552391.');
+ testString: assert.strictEqual(euler72(), 303963552391);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.english.md
index da3d607e9d..14c146e3b6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.english.md
@@ -24,7 +24,7 @@ How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper f
```yml
tests:
- text: euler73() should return 7295372.
- testString: assert.strictEqual(euler73(), 7295372, 'euler73() should return 7295372.');
+ testString: assert.strictEqual(euler73(), 7295372);
```