From 3e237f43adc7fb0fa1147815d1c0c0021bce5673 Mon Sep 17 00:00:00 2001
From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>
Date: Fri, 26 Jul 2019 19:30:17 -0700
Subject: [PATCH] fix: removed assert msg argument-3 (#36417)
---
...m-235-an-arithmetic-geometric-sequence.english.md | 2 +-
.../problem-236-luxury-hampers.english.md | 2 +-
...lem-237-tours-on-a-4-x-n-playing-board.english.md | 2 +-
.../problem-238-infinite-string-tour.english.md | 2 +-
.../problem-239-twenty-two-foolish-primes.english.md | 2 +-
.../problem-24-lexicographic-permutations.english.md | 8 ++++----
.../project-euler/problem-240-top-dice.english.md | 2 +-
.../problem-241-perfection-quotients.english.md | 2 +-
.../problem-242-odd-triplets.english.md | 2 +-
.../project-euler/problem-243-resilience.english.md | 2 +-
.../project-euler/problem-244-sliders.english.md | 2 +-
.../problem-245-coresilience.english.md | 2 +-
.../problem-246-tangents-to-an-ellipse.english.md | 2 +-
.../problem-247-squares-under-a-hyperbola.english.md | 2 +-
...hich-eulers-totient-function-equals-13.english.md | 2 +-
.../problem-249-prime-subset-sums.english.md | 2 +-
...problem-25-1000-digit-fibonacci-number.english.md | 8 ++++----
.../project-euler/problem-250-250250.english.md | 2 +-
.../problem-251-cardano-triplets.english.md | 2 +-
.../problem-252-convex-holes.english.md | 2 +-
.../project-euler/problem-253-tidying-up.english.md | 2 +-
.../problem-254-sums-of-digit-factorials.english.md | 2 +-
.../problem-255-rounded-square-roots.english.md | 2 +-
.../problem-256-tatami-free-rooms.english.md | 2 +-
.../problem-257-angular-bisectors.english.md | 2 +-
...roblem-258-a-lagged-fibonacci-sequence.english.md | 2 +-
.../problem-259-reachable-numbers.english.md | 2 +-
.../problem-26-reciprocal-cycles.english.md | 8 ++++----
.../project-euler/problem-260-stone-game.english.md | 2 +-
.../problem-261-pivotal-square-sums.english.md | 2 +-
.../problem-262-mountain-range.english.md | 2 +-
...oblem-263-an-engineers-dream-come-true.english.md | 2 +-
.../problem-264-triangle-centres.english.md | 2 +-
.../problem-265-binary-circles.english.md | 2 +-
.../problem-266-pseudo-square-root.english.md | 2 +-
.../project-euler/problem-267-billionaire.english.md | 2 +-
...r-distinct-prime-factors-less-than-100.english.md | 2 +-
...nomials-with-at-least-one-integer-root.english.md | 2 +-
.../problem-27-quadratic-primes.english.md | 8 ++++----
.../problem-270-cutting-squares.english.md | 2 +-
.../problem-271-modular-cubes-part-1.english.md | 2 +-
.../problem-272-modular-cubes-part-2.english.md | 2 +-
.../problem-273-sum-of-squares.english.md | 2 +-
.../problem-274-divisibility-multipliers.english.md | 2 +-
.../problem-275-balanced-sculptures.english.md | 2 +-
.../problem-276-primitive-triangles.english.md | 2 +-
...roblem-277-a-modified-collatz-sequence.english.md | 2 +-
...-278-linear-combinations-of-semiprimes.english.md | 2 +-
...h-integral-sides-and-an-integral-angle.english.md | 2 +-
.../problem-28-number-spiral-diagonals.english.md | 8 ++++----
.../problem-280-ant-and-seeds.english.md | 2 +-
.../problem-281-pizza-toppings.english.md | 2 +-
.../problem-282-the-ackermann-function.english.md | 2 +-
...-the-area--perimeter-ratio-is-integral.english.md | 2 +-
.../problem-285-pythagorean-odds.english.md | 2 +-
.../problem-286-scoring-probabilities.english.md | 2 +-
...ncoding-a-simple-compression-algorithm.english.md | 2 +-
.../problem-288-an-enormous-factorial.english.md | 2 +-
.../problem-289-eulerian-cycles.english.md | 2 +-
.../problem-29-distinct-powers.english.md | 8 ++++----
.../problem-290-digital-signature.english.md | 2 +-
.../problem-291-panaitopol-primes.english.md | 2 +-
.../problem-292-pythagorean-polygons.english.md | 2 +-
.../problem-293-pseudo-fortunate-numbers.english.md | 2 +-
...blem-294-sum-of-digits---experience-23.english.md | 2 +-
.../problem-295-lenticular-holes.english.md | 2 +-
...oblem-296-angular-bisector-and-tangent.english.md | 2 +-
.../problem-297-zeckendorf-representation.english.md | 2 +-
.../problem-298-selective-amnesia.english.md | 2 +-
.../problem-299-three-similar-triangles.english.md | 2 +-
.../problem-3-largest-prime-factor.english.md | 12 ++++++------
.../problem-30-digit-n-powers.english.md | 8 ++++----
.../problem-300-protein-folding.english.md | 2 +-
.../project-euler/problem-301-nim.english.md | 2 +-
.../problem-302-strong-achilles-numbers.english.md | 2 +-
75 files changed, 101 insertions(+), 101 deletions(-)
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.english.md
index 615b335793..6ec3322083 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.english.md
@@ -27,7 +27,7 @@ Give your answer rounded to 12 places behind the decimal point.
```yml
tests:
- text: euler235() should return 1.002322108633.
- testString: assert.strictEqual(euler235(), 1.002322108633, 'euler235() should return 1.002322108633.');
+ testString: assert.strictEqual(euler235(), 1.002322108633);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-236-luxury-hampers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-236-luxury-hampers.english.md
index fa38c961ad..aa869dae58 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-236-luxury-hampers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-236-luxury-hampers.english.md
@@ -32,7 +32,7 @@ Give your answer as a fraction reduced to its lowest terms, in the form u/v.
```yml
tests:
- text: euler236() should return 123 / 59.
- testString: assert.strictEqual(euler236(), 123 / 59, 'euler236() should return 123 / 59.');
+ testString: assert.strictEqual(euler236(), 123 / 59);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.english.md
index ca07bd7b1c..18e8c0a098 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.english.md
@@ -30,7 +30,7 @@ T(10) is 2329. What is T(1012) modulo 108?
```yml
tests:
- text: euler237() should return 15836928.
- testString: assert.strictEqual(euler237(), 15836928, 'euler237() should return 15836928.');
+ testString: assert.strictEqual(euler237(), 15836928);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-238-infinite-string-tour.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-238-infinite-string-tour.english.md
index f7212fae81..32a5a49792 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-238-infinite-string-tour.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-238-infinite-string-tour.english.md
@@ -53,7 +53,7 @@ Find ∑ p(k), for 0 < k ≤ 2·1015.
```yml
tests:
- text: euler238() should return 9922545104535660.
- testString: assert.strictEqual(euler238(), 9922545104535660, 'euler238() should return 9922545104535660.');
+ testString: assert.strictEqual(euler238(), 9922545104535660);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.english.md
index 3e2cc2f99b..4bfb4f80c8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.english.md
@@ -25,7 +25,7 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc
```yml
tests:
- text: euler239() should return 0.001887854841.
- testString: assert.strictEqual(euler239(), 0.001887854841, 'euler239() should return 0.001887854841.');
+ testString: assert.strictEqual(euler239(), 0.001887854841);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.english.md
index fcd487be03..70fdbeaaf5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.english.md
@@ -22,13 +22,13 @@ What is the nth lexicographic permutation of the digits 0, 1, 2, 3, 4
```yml
tests:
- text: lexicographicPermutations(699999) should return 1938246570.
- testString: assert(lexicographicPermutations(699999) == 1938246570, 'lexicographicPermutations(699999) should return 1938246570.');
+ testString: assert(lexicographicPermutations(699999) == 1938246570);
- text: lexicographicPermutations(899999) should return 2536987410.
- testString: assert(lexicographicPermutations(899999) == 2536987410, 'lexicographicPermutations(899999) should return 2536987410.');
+ testString: assert(lexicographicPermutations(899999) == 2536987410);
- text: lexicographicPermutations(900000) should return 2537014689.
- testString: assert(lexicographicPermutations(900000) == 2537014689, 'lexicographicPermutations(900000) should return 2537014689.');
+ testString: assert(lexicographicPermutations(900000) == 2537014689);
- text: lexicographicPermutations(999999) should return 2783915460.
- testString: assert(lexicographicPermutations(999999) == 2783915460, 'lexicographicPermutations(999999) should return 2783915460.');
+ testString: assert(lexicographicPermutations(999999) == 2783915460);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-240-top-dice.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-240-top-dice.english.md
index 637aab6612..4a709c13d8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-240-top-dice.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-240-top-dice.english.md
@@ -31,7 +31,7 @@ In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so
```yml
tests:
- text: euler240() should return 7448717393364182000.
- testString: assert.strictEqual(euler240(), 7448717393364182000, 'euler240() should return 7448717393364182000.');
+ testString: assert.strictEqual(euler240(), 7448717393364182000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md
index afcd9065b0..8a54372589 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md
@@ -28,7 +28,7 @@ Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k +
```yml
tests:
- text: euler241() should return 482316491800641150.
- testString: assert.strictEqual(euler241(), 482316491800641150, 'euler241() should return 482316491800641150.');
+ testString: assert.strictEqual(euler241(), 482316491800641150);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-242-odd-triplets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-242-odd-triplets.english.md
index 55c2e60fab..f2670cc3ee 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-242-odd-triplets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-242-odd-triplets.english.md
@@ -28,7 +28,7 @@ How many odd-triplets are there with n ≤ 1012 ?
```yml
tests:
- text: euler242() should return 997104142249036700.
- testString: assert.strictEqual(euler242(), 997104142249036700, 'euler242() should return 997104142249036700.');
+ testString: assert.strictEqual(euler242(), 997104142249036700);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-243-resilience.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-243-resilience.english.md
index f70b97c54a..85389da43f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-243-resilience.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-243-resilience.english.md
@@ -28,7 +28,7 @@ Find the smallest denominator d, having a resilience R(d) < 15499/94744 .
```yml
tests:
- text: euler243() should return 892371480.
- testString: assert.strictEqual(euler243(), 892371480, 'euler243() should return 892371480.');
+ testString: assert.strictEqual(euler243(), 892371480);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md
index a1d04ad99c..7762d6f6fe 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md
@@ -45,7 +45,7 @@ What is the sum of all checksums for the paths having the minimal length?
```yml
tests:
- text: euler244() should return 96356848.
- testString: assert.strictEqual(euler244(), 96356848, 'euler244() should return 96356848.');
+ testString: assert.strictEqual(euler244(), 96356848);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-245-coresilience.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-245-coresilience.english.md
index d8e710218f..fe79b351e5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-245-coresilience.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-245-coresilience.english.md
@@ -30,7 +30,7 @@ Find the sum of all composite integers 1 < n ≤ 2×1011, for which C(n) is a un
```yml
tests:
- text: euler245() should return 288084712410001.
- testString: assert.strictEqual(euler245(), 288084712410001, 'euler245() should return 288084712410001.');
+ testString: assert.strictEqual(euler245(), 288084712410001);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.english.md
index 5d164c7d01..9e72f116cd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.english.md
@@ -38,7 +38,7 @@ For how many lattice points P is angle RPS greater than 45 degrees?
```yml
tests:
- text: euler246() should return 810834388.
- testString: assert.strictEqual(euler246(), 810834388, 'euler246() should return 810834388.');
+ testString: assert.strictEqual(euler246(), 810834388);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.english.md
index 9019b90e90..11ae0a085d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.english.md
@@ -35,7 +35,7 @@ What is the largest n for which the index of Sn is (3,3)?
```yml
tests:
- text: euler247() should return 782252.
- testString: assert.strictEqual(euler247(), 782252, 'euler247() should return 782252.');
+ testString: assert.strictEqual(euler247(), 782252);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.english.md
index b6860f0fc1..d951b2e3ed 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.english.md
@@ -21,7 +21,7 @@ Find the 150,000th such number.
```yml
tests:
- text: euler248() should return 23507044290.
- testString: assert.strictEqual(euler248(), 23507044290, 'euler248() should return 23507044290.');
+ testString: assert.strictEqual(euler248(), 23507044290);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-249-prime-subset-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-249-prime-subset-sums.english.md
index 70e2cf9d3b..d7415e2cdc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-249-prime-subset-sums.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-249-prime-subset-sums.english.md
@@ -22,7 +22,7 @@ Enter the rightmost 16 digits as your answer.
```yml
tests:
- text: euler249() should return 9275262564250418.
- testString: assert.strictEqual(euler249(), 9275262564250418, 'euler249() should return 9275262564250418.');
+ testString: assert.strictEqual(euler249(), 9275262564250418);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.english.md
index 121f322b76..bfcaf8c24d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.english.md
@@ -25,13 +25,13 @@ What is the index of the first term in the Fibonacci sequence to contain n<
```yml
tests:
- text: digitFibonacci(5) should return 21.
- testString: assert.strictEqual(digitFibonacci(5), 21, 'digitFibonacci(5) should return 21.');
+ testString: assert.strictEqual(digitFibonacci(5), 21);
- text: digitFibonacci(10) should return 45.
- testString: assert.strictEqual(digitFibonacci(10), 45, 'digitFibonacci(10) should return 45.');
+ testString: assert.strictEqual(digitFibonacci(10), 45);
- text: digitFibonacci(15) should return 69.
- testString: assert.strictEqual(digitFibonacci(15), 69, 'digitFibonacci(15) should return 69.');
+ testString: assert.strictEqual(digitFibonacci(15), 69);
- text: digitFibonacci(20) should return 93.
- testString: assert.strictEqual(digitFibonacci(20), 93, 'digitFibonacci(20) should return 93.');
+ testString: assert.strictEqual(digitFibonacci(20), 93);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-250-250250.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-250-250250.english.md
index f6361ae8c0..acf65c03bb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-250-250250.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-250-250250.english.md
@@ -20,7 +20,7 @@ Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum
```yml
tests:
- text: euler250() should return 1425480602091519.
- testString: assert.strictEqual(euler250(), 1425480602091519, 'euler250() should return 1425480602091519.');
+ testString: assert.strictEqual(euler250(), 1425480602091519);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md
index 2fecec2fca..dc7b195fe5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md
@@ -30,7 +30,7 @@ Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.
```yml
tests:
- text: euler251() should return 18946051.
- testString: assert.strictEqual(euler251(), 18946051, 'euler251() should return 18946051.');
+ testString: assert.strictEqual(euler251(), 18946051);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-252-convex-holes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-252-convex-holes.english.md
index 6408583051..e7709d4af3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-252-convex-holes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-252-convex-holes.english.md
@@ -46,7 +46,7 @@ What is the maximum area for a convex hole on the set containing the first 500 p
```yml
tests:
- text: euler252() should return 104924.
- testString: assert.strictEqual(euler252(), 104924, 'euler252() should return 104924.');
+ testString: assert.strictEqual(euler252(), 104924);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-253-tidying-up.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-253-tidying-up.english.md
index e3eab8c7d2..5fc7295522 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-253-tidying-up.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-253-tidying-up.english.md
@@ -38,7 +38,7 @@ Give your answer rounded to six decimal places.
```yml
tests:
- text: euler253() should return 11.492847.
- testString: assert.strictEqual(euler253(), 11.492847, 'euler253() should return 11.492847.');
+ testString: assert.strictEqual(euler253(), 11.492847);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.english.md
index 09254949ba..1eda45d2b9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.english.md
@@ -30,7 +30,7 @@ What is ∑ sg(i) for 1 ≤ i ≤ 150?
```yml
tests:
- text: euler254() should return 8184523820510.
- testString: assert.strictEqual(euler254(), 8184523820510, 'euler254() should return 8184523820510.');
+ testString: assert.strictEqual(euler254(), 8184523820510);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-255-rounded-square-roots.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-255-rounded-square-roots.english.md
index 91d3cbfab8..7ec86961b5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-255-rounded-square-roots.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-255-rounded-square-roots.english.md
@@ -43,7 +43,7 @@ Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling f
```yml
tests:
- text: euler255() should return 4.447401118.
- testString: assert.strictEqual(euler255(), 4.447401118, 'euler255() should return 4.447401118.');
+ testString: assert.strictEqual(euler255(), 4.447401118);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.english.md
index 03416ac202..2d4d6fb11e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.english.md
@@ -45,7 +45,7 @@ Find the smallest room-size s for which T(s) = 200.
```yml
tests:
- text: euler256() should return 85765680.
- testString: assert.strictEqual(euler256(), 85765680, 'euler256() should return 85765680.');
+ testString: assert.strictEqual(euler256(), 85765680);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-257-angular-bisectors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-257-angular-bisectors.english.md
index 4519f61fe4..10cd4b93ff 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-257-angular-bisectors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-257-angular-bisectors.english.md
@@ -32,7 +32,7 @@ How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area
```yml
tests:
- text: euler257() should return 139012411.
- testString: assert.strictEqual(euler257(), 139012411, 'euler257() should return 139012411.');
+ testString: assert.strictEqual(euler257(), 139012411);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
index 7397b70548..e6917c53f4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
@@ -24,7 +24,7 @@ Find gk mod 20092010 for k = 1018.
```yml
tests:
- text: euler258() should return 12747994.
- testString: assert.strictEqual(euler258(), 12747994, 'euler258() should return 12747994.');
+ testString: assert.strictEqual(euler258(), 12747994);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-259-reachable-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-259-reachable-numbers.english.md
index 6f568fa86d..1704c165e4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-259-reachable-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-259-reachable-numbers.english.md
@@ -30,7 +30,7 @@ What is the sum of all positive reachable integers?
```yml
tests:
- text: euler259() should return 20101196798.
- testString: assert.strictEqual(euler259(), 20101196798, 'euler259() should return 20101196798.');
+ testString: assert.strictEqual(euler259(), 20101196798);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.english.md
index e9bd88b2aa..6c62ef8942 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.english.md
@@ -23,13 +23,13 @@ Find the value of d < n for which 1/dreciprocalCycles(700) should return 659.
- testString: assert(reciprocalCycles(700) == 659, 'reciprocalCycles(700) should return 659.');
+ testString: assert(reciprocalCycles(700) == 659);
- text: reciprocalCycles(800) should return 743.
- testString: assert(reciprocalCycles(800) == 743, 'reciprocalCycles(800) should return 743.');
+ testString: assert(reciprocalCycles(800) == 743);
- text: reciprocalCycles(900) should return 887.
- testString: assert(reciprocalCycles(900) == 887, 'reciprocalCycles(900) should return 887.');
+ testString: assert(reciprocalCycles(900) == 887);
- text: reciprocalCycles(1000) should return 983.
- testString: assert(reciprocalCycles(1000) == 983, 'reciprocalCycles(1000) should return 983.');
+ testString: assert(reciprocalCycles(1000) == 983);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-260-stone-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-260-stone-game.english.md
index 09fff2a26c..8ab56e773c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-260-stone-game.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-260-stone-game.english.md
@@ -39,7 +39,7 @@ with xi ≤ yi ≤ zi ≤ 1000.
```yml
tests:
- text: euler260() should return 167542057.
- testString: assert.strictEqual(euler260(), 167542057, 'euler260() should return 167542057.');
+ testString: assert.strictEqual(euler260(), 167542057);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.english.md
index d7b5b420c4..d5f7c3916d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.english.md
@@ -29,7 +29,7 @@ Some small square-pivots are
```yml
tests:
- text: euler261() should return 238890850232021.
- testString: assert.strictEqual(euler261(), 238890850232021, 'euler261() should return 238890850232021.');
+ testString: assert.strictEqual(euler261(), 238890850232021);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-262-mountain-range.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-262-mountain-range.english.md
index 8bbde219a5..71b7f0bb16 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-262-mountain-range.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-262-mountain-range.english.md
@@ -35,7 +35,7 @@ h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) ) * exp( -abs(0.000001*(x*x+y*y)-0.0015*
```yml
tests:
- text: euler262() should return 2531.205.
- testString: assert.strictEqual(euler262(), 2531.205, 'euler262() should return 2531.205.');
+ testString: assert.strictEqual(euler262(), 2531.205);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.english.md
index 026921afb2..bc286bcc30 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.english.md
@@ -39,7 +39,7 @@ Find the sum of the first four engineers’ paradises.
```yml
tests:
- text: euler263() should return 2039506520.
- testString: assert.strictEqual(euler263(), 2039506520, 'euler263() should return 2039506520.');
+ testString: assert.strictEqual(euler263(), 2039506520);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-264-triangle-centres.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-264-triangle-centres.english.md
index a2bb89721c..5c88fa7913 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-264-triangle-centres.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-264-triangle-centres.english.md
@@ -40,7 +40,7 @@ Enter as your answer the sum of their perimeters rounded to four decimal places.
```yml
tests:
- text: euler264() should return 2816417.1055.
- testString: assert.strictEqual(euler264(), 2816417.1055, 'euler264() should return 2816417.1055.');
+ testString: assert.strictEqual(euler264(), 2816417.1055);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-265-binary-circles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-265-binary-circles.english.md
index dea8d9367b..9882988ea6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-265-binary-circles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-265-binary-circles.english.md
@@ -33,7 +33,7 @@ Find S(5).
```yml
tests:
- text: euler265() should return 209110240768.
- testString: assert.strictEqual(euler265(), 209110240768, 'euler265() should return 209110240768.');
+ testString: assert.strictEqual(euler265(), 209110240768);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-266-pseudo-square-root.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-266-pseudo-square-root.english.md
index d3ca67fca1..c833ed2e71 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-266-pseudo-square-root.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-266-pseudo-square-root.english.md
@@ -27,7 +27,7 @@ Find PSR(p) mod 1016.
```yml
tests:
- text: euler266() should return 1096883702440585.
- testString: assert.strictEqual(euler266(), 1096883702440585, 'euler266() should return 1096883702440585.');
+ testString: assert.strictEqual(euler266(), 1096883702440585);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-267-billionaire.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-267-billionaire.english.md
index 401d628155..88da6c3835 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-267-billionaire.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-267-billionaire.english.md
@@ -25,7 +25,7 @@ All computations are assumed to be exact (no rounding), but give your answer rou
```yml
tests:
- text: euler267() should return 0.999992836187.
- testString: assert.strictEqual(euler267(), 0.999992836187, 'euler267() should return 0.999992836187.');
+ testString: assert.strictEqual(euler267(), 0.999992836187);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md
index d91bf44da7..12ec1a4abd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md
@@ -22,7 +22,7 @@ Find how many positive integers less than 1016 are divisible by at least four di
```yml
tests:
- text: euler268() should return 785478606870985.
- testString: assert.strictEqual(euler268(), 785478606870985, 'euler268() should return 785478606870985.');
+ testString: assert.strictEqual(euler268(), 785478606870985);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.english.md
index 8610c12775..08ef0c6e11 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.english.md
@@ -30,7 +30,7 @@ What is Z(1016)?
```yml
tests:
- text: euler269() should return 1311109198529286.
- testString: assert.strictEqual(euler269(), 1311109198529286, 'euler269() should return 1311109198529286.');
+ testString: assert.strictEqual(euler269(), 1311109198529286);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-27-quadratic-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-27-quadratic-primes.english.md
index 85ea151d77..f54fec1865 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-27-quadratic-primes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-27-quadratic-primes.english.md
@@ -28,13 +28,13 @@ Find the product of the coefficients, $a$ and $b$, for the quadratic expression
```yml
tests:
- text: quadraticPrimes(200) should return -4925.
- testString: assert(quadraticPrimes(200) == -4925, 'quadraticPrimes(200) should return -4925.');
+ testString: assert(quadraticPrimes(200) == -4925);
- text: quadraticPrimes(500) should return -18901.
- testString: assert(quadraticPrimes(500) == -18901, 'quadraticPrimes(500) should return -18901.');
+ testString: assert(quadraticPrimes(500) == -18901);
- text: quadraticPrimes(800) should return -43835.
- testString: assert(quadraticPrimes(800) == -43835, 'quadraticPrimes(800) should return -43835.');
+ testString: assert(quadraticPrimes(800) == -43835);
- text: quadraticPrimes(1000) should return -59231.
- testString: assert(quadraticPrimes(1000) == -59231, 'quadraticPrimes(1000) should return -59231.');
+ testString: assert(quadraticPrimes(1000) == -59231);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-270-cutting-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-270-cutting-squares.english.md
index 579c4f684c..8377c950f8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-270-cutting-squares.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-270-cutting-squares.english.md
@@ -27,7 +27,7 @@ What is C(30) mod 108 ?
```yml
tests:
- text: euler270() should return 82282080.
- testString: assert.strictEqual(euler270(), 82282080, 'euler270() should return 82282080.');
+ testString: assert.strictEqual(euler270(), 82282080);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.english.md
index 18854d5880..fb5d1ae454 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.english.md
@@ -26,7 +26,7 @@ Find S(13082761331670030).
```yml
tests:
- text: euler271() should return 4617456485273130000.
- testString: assert.strictEqual(euler271(), 4617456485273130000, 'euler271() should return 4617456485273130000.');
+ testString: assert.strictEqual(euler271(), 4617456485273130000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md
index 70bced9fe1..a91d22f1cb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md
@@ -26,7 +26,7 @@ Find the sum of the positive numbers n≤1011 for which C(n)=242.
```yml
tests:
- text: euler272() should return 8495585919506151000.
- testString: assert.strictEqual(euler272(), 8495585919506151000, 'euler272() should return 8495585919506151000.');
+ testString: assert.strictEqual(euler272(), 8495585919506151000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-273-sum-of-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-273-sum-of-squares.english.md
index 964a227e05..5c870fb2e0 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-273-sum-of-squares.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-273-sum-of-squares.english.md
@@ -26,7 +26,7 @@ Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 wit
```yml
tests:
- text: euler273() should return 2032447591196869000.
- testString: assert.strictEqual(euler273(), 2032447591196869000, 'euler273() should return 2032447591196869000.');
+ testString: assert.strictEqual(euler273(), 2032447591196869000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.english.md
index ae9da66a2b..b9d37558dc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.english.md
@@ -32,7 +32,7 @@ The sum of the divisibility multipliers for the primes that are coprime to 10 an
```yml
tests:
- text: euler274() should return 1601912348822.
- testString: assert.strictEqual(euler274(), 1601912348822, 'euler274() should return 1601912348822.');
+ testString: assert.strictEqual(euler274(), 1601912348822);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-275-balanced-sculptures.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-275-balanced-sculptures.english.md
index 750c0efa41..c535d26130 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-275-balanced-sculptures.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-275-balanced-sculptures.english.md
@@ -28,7 +28,7 @@ There are 964 balanced sculptures of order 10 and 360505 of order 15.How many ba
```yml
tests:
- text: euler275() should return 15030564.
- testString: assert.strictEqual(euler275(), 15030564, 'euler275() should return 15030564.');
+ testString: assert.strictEqual(euler275(), 15030564);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.english.md
index 46fe6c8788..aa55e03211 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.english.md
@@ -22,7 +22,7 @@ How many primitive integer sided triangles exist with a perimeter not exceeding
```yml
tests:
- text: euler276() should return 5777137137739633000.
- testString: assert.strictEqual(euler276(), 5777137137739633000, 'euler276() should return 5777137137739633000.');
+ testString: assert.strictEqual(euler276(), 5777137137739633000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.english.md
index bc3f28dc7c..9adbde6ce5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.english.md
@@ -44,7 +44,7 @@ What is the smallest a1 > 1015 that begins with the sequence "UDDDUdddDDUDDddDdD
```yml
tests:
- text: euler277() should return 1125977393124310.
- testString: assert.strictEqual(euler277(), 1125977393124310, 'euler277() should return 1125977393124310.');
+ testString: assert.strictEqual(euler277(), 1125977393124310);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.english.md
index ec4ecdbbb0..293e36d359 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.english.md
@@ -30,7 +30,7 @@ Find ∑ f(p*q,p*r,q*r), where p, q and r are prime numbers and p < q < r < 5000
```yml
tests:
- text: euler278() should return 1228215747273908500.
- testString: assert.strictEqual(euler278(), 1228215747273908500, 'euler278() should return 1228215747273908500.');
+ testString: assert.strictEqual(euler278(), 1228215747273908500);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.english.md
index 46b598fa72..3ce441a0a4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.english.md
@@ -20,7 +20,7 @@ How many triangles are there with integral sides, at least one integral angle (m
```yml
tests:
- text: euler279() should return 416577688.
- testString: assert.strictEqual(euler279(), 416577688, 'euler279() should return 416577688.');
+ testString: assert.strictEqual(euler279(), 416577688);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.english.md
index f4f7bbff2a..bae30fb869 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.english.md
@@ -27,13 +27,13 @@ What is the sum of the numbers on the diagonals in a n by n spiral formed in the
```yml
tests:
- text: spiralDiagonals(101) should return 692101.
- testString: assert(spiralDiagonals(101) == 692101, 'spiralDiagonals(101) should return 692101.');
+ testString: assert(spiralDiagonals(101) == 692101);
- text: spiralDiagonals(303) should return 18591725.
- testString: assert(spiralDiagonals(303) == 18591725, 'spiralDiagonals(303) should return 18591725.');
+ testString: assert(spiralDiagonals(303) == 18591725);
- text: spiralDiagonals(505) should return 85986601.
- testString: assert(spiralDiagonals(505) == 85986601, 'spiralDiagonals(505) should return 85986601.');
+ testString: assert(spiralDiagonals(505) == 85986601);
- text: spiralDiagonals(1001) should return 669171001.
- testString: assert(spiralDiagonals(1001) == 669171001, 'spiralDiagonals(1001) should return 669171001.');
+ testString: assert(spiralDiagonals(1001) == 669171001);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-280-ant-and-seeds.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-280-ant-and-seeds.english.md
index 156a23fac2..5450594432 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-280-ant-and-seeds.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-280-ant-and-seeds.english.md
@@ -25,7 +25,7 @@ Give your answer rounded to 6 decimal places.
```yml
tests:
- text: euler280() should return 430.088247.
- testString: assert.strictEqual(euler280(), 430.088247, 'euler280() should return 430.088247.');
+ testString: assert.strictEqual(euler280(), 430.088247);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-281-pizza-toppings.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-281-pizza-toppings.english.md
index 6129c4df43..180b4e8736 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-281-pizza-toppings.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-281-pizza-toppings.english.md
@@ -28,7 +28,7 @@ Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
```yml
tests:
- text: euler281() should return 1485776387445623.
- testString: assert.strictEqual(euler281(), 1485776387445623, 'euler281() should return 1485776387445623.');
+ testString: assert.strictEqual(euler281(), 1485776387445623);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md
index ef25c332d1..342399085b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md
@@ -27,7 +27,7 @@ Find A(n, n) and give your answer mod 148.
```yml
tests:
- text: euler282() should return 1098988351.
- testString: assert.strictEqual(euler282(), 1098988351, 'euler282() should return 1098988351.');
+ testString: assert.strictEqual(euler282(), 1098988351);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.english.md
index 6078dc6c71..63f0fa032e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.english.md
@@ -26,7 +26,7 @@ Find the sum of the perimeters of all integer sided triangles for which the area
```yml
tests:
- text: euler283() should return 28038042525570324.
- testString: assert.strictEqual(euler283(), 28038042525570324, 'euler283() should return 28038042525570324.');
+ testString: assert.strictEqual(euler283(), 28038042525570324);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-285-pythagorean-odds.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-285-pythagorean-odds.english.md
index 018ba4a293..678826bbbb 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-285-pythagorean-odds.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-285-pythagorean-odds.english.md
@@ -29,7 +29,7 @@ If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, wh
```yml
tests:
- text: euler285() should return 157055.80999.
- testString: assert.strictEqual(euler285(), 157055.80999, 'euler285() should return 157055.80999.');
+ testString: assert.strictEqual(euler285(), 157055.80999);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-286-scoring-probabilities.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-286-scoring-probabilities.english.md
index 74b21de4b6..5eb65d6393 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-286-scoring-probabilities.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-286-scoring-probabilities.english.md
@@ -24,7 +24,7 @@ Find q and give your answer rounded to 10 decimal places.
```yml
tests:
- text: euler286() should return 52.6494571953.
- testString: assert.strictEqual(euler286(), 52.6494571953, 'euler286() should return 52.6494571953.');
+ testString: assert.strictEqual(euler286(), 52.6494571953);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.english.md
index c18be69201..9c02befb5b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.english.md
@@ -35,7 +35,7 @@ otherwise the pixel is white.What is the length of the minimal sequence describi
```yml
tests:
- text: euler287() should return 313135496.
- testString: assert.strictEqual(euler287(), 313135496, 'euler287() should return 313135496.');
+ testString: assert.strictEqual(euler287(), 313135496);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.english.md
index f50fc2510f..9f54fecef7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.english.md
@@ -35,7 +35,7 @@ Find NF(61,107) mod 6110
```yml
tests:
- text: euler288() should return 605857431263982000.
- testString: assert.strictEqual(euler288(), 605857431263982000, 'euler288() should return 605857431263982000.');
+ testString: assert.strictEqual(euler288(), 605857431263982000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-289-eulerian-cycles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-289-eulerian-cycles.english.md
index 8462bb025a..de0ec998ff 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-289-eulerian-cycles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-289-eulerian-cycles.english.md
@@ -34,7 +34,7 @@ Find L(6,10) mod 1010.
```yml
tests:
- text: euler289() should return 6567944538.
- testString: assert.strictEqual(euler289(), 6567944538, 'euler289() should return 6567944538.');
+ testString: assert.strictEqual(euler289(), 6567944538);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-29-distinct-powers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-29-distinct-powers.english.md
index 50382442bd..872a95a3a7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-29-distinct-powers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-29-distinct-powers.english.md
@@ -27,13 +27,13 @@ How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ n an
```yml
tests:
- text: distinctPowers(15) should return 177.
- testString: assert.strictEqual(distinctPowers(15), 177, 'distinctPowers(15) should return 177.');
+ testString: assert.strictEqual(distinctPowers(15), 177);
- text: distinctPowers(20) should return 324.
- testString: assert.strictEqual(distinctPowers(20), 324, 'distinctPowers(20) should return 324.');
+ testString: assert.strictEqual(distinctPowers(20), 324);
- text: distinctPowers(25) should return 519.
- testString: assert.strictEqual(distinctPowers(25), 519, 'distinctPowers(25) should return 519.');
+ testString: assert.strictEqual(distinctPowers(25), 519);
- text: distinctPowers(30) should return 755.
- testString: assert.strictEqual(distinctPowers(30), 755, 'distinctPowers(30) should return 755.');
+ testString: assert.strictEqual(distinctPowers(30), 755);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-290-digital-signature.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-290-digital-signature.english.md
index b5881f6e12..5ea0ce1dcd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-290-digital-signature.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-290-digital-signature.english.md
@@ -20,7 +20,7 @@ How many integers 0 ≤ n < 1018 have the property that the sum of the digits of
```yml
tests:
- text: euler290() should return 20444710234716470.
- testString: assert.strictEqual(euler290(), 20444710234716470, 'euler290() should return 20444710234716470.');
+ testString: assert.strictEqual(euler290(), 20444710234716470);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
index a5f1779bf3..241f026917 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
@@ -23,7 +23,7 @@ Find how many Panaitopol primes are less than 5×1015.
```yml
tests:
- text: euler291() should return 4037526.
- testString: assert.strictEqual(euler291(), 4037526, 'euler291() should return 4037526.');
+ testString: assert.strictEqual(euler291(), 4037526);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.english.md
index 8cced2ec3d..04b0ae54a8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.english.md
@@ -27,7 +27,7 @@ Find P(120).
```yml
tests:
- text: euler292() should return 3600060866.
- testString: assert.strictEqual(euler292(), 3600060866, 'euler292() should return 3600060866.');
+ testString: assert.strictEqual(euler292(), 3600060866);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.english.md
index 31b39c6208..a7d41026ac 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.english.md
@@ -32,7 +32,7 @@ Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N l
```yml
tests:
- text: euler293() should return 2209.
- testString: assert.strictEqual(euler293(), 2209, 'euler293() should return 2209.');
+ testString: assert.strictEqual(euler293(), 2209);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.english.md
index 2b27fc6fc7..599fece4d6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.english.md
@@ -31,7 +31,7 @@ Find S(1112) and give your answer mod 109.
```yml
tests:
- text: euler294() should return 789184709.
- testString: assert.strictEqual(euler294(), 789184709, 'euler294() should return 789184709.');
+ testString: assert.strictEqual(euler294(), 789184709);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-295-lenticular-holes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-295-lenticular-holes.english.md
index f3889ac24d..4733964ee3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-295-lenticular-holes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-295-lenticular-holes.english.md
@@ -42,7 +42,7 @@ Find L(100 000).
```yml
tests:
- text: euler295() should return 4884650818.
- testString: assert.strictEqual(euler295(), 4884650818, 'euler295() should return 4884650818.');
+ testString: assert.strictEqual(euler295(), 4884650818);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.english.md
index 0c6760e5a5..dcbec33e17 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.english.md
@@ -25,7 +25,7 @@ How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE
```yml
tests:
- text: euler296() should return 1137208419.
- testString: assert.strictEqual(euler296(), 1137208419, 'euler296() should return 1137208419.');
+ testString: assert.strictEqual(euler296(), 1137208419);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.english.md
index 39bba931d5..a28315e14c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.english.md
@@ -30,7 +30,7 @@ Find ∑ z(n) for 0euler297() should return 2252639041804718000.
- testString: assert.strictEqual(euler297(), 2252639041804718000, 'euler297() should return 2252639041804718000.');
+ testString: assert.strictEqual(euler297(), 2252639041804718000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-298-selective-amnesia.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-298-selective-amnesia.english.md
index 5bca275f95..997a7e71f5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-298-selective-amnesia.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-298-selective-amnesia.english.md
@@ -94,7 +94,7 @@ Denoting Larry's score by L and Robin's score by R, what is the expected value o
```yml
tests:
- text: euler298() should return 1.76882294.
- testString: assert.strictEqual(euler298(), 1.76882294, 'euler298() should return 1.76882294.');
+ testString: assert.strictEqual(euler298(), 1.76882294);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-299-three-similar-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-299-three-similar-triangles.english.md
index 8091125029..18c8294c49 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-299-three-similar-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-299-three-similar-triangles.english.md
@@ -33,7 +33,7 @@ If b+d < 100 000 000, how many distinct triplets (a,b,d) are there such that p
```yml
tests:
- text: euler299() should return 549936643.
- testString: assert.strictEqual(euler299(), 549936643, 'euler299() should return 549936643.');
+ testString: assert.strictEqual(euler299(), 549936643);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.english.md
index 961ecc011d..60a1c780c1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.english.md
@@ -21,17 +21,17 @@ What is the largest prime factor of the given number?
```yml
tests:
- text: largestPrimeFactor(2) should return 2.
- testString: assert.strictEqual(largestPrimeFactor(2), 2, 'largestPrimeFactor(2) should return 2.');
+ testString: assert.strictEqual(largestPrimeFactor(2), 2);
- text: largestPrimeFactor(3) should return 3.
- testString: assert.strictEqual(largestPrimeFactor(3), 3, 'largestPrimeFactor(3) should return 3.');
+ testString: assert.strictEqual(largestPrimeFactor(3), 3);
- text: largestPrimeFactor(5) should return 5.
- testString: assert.strictEqual(largestPrimeFactor(5), 5, 'largestPrimeFactor(5) should return 5.');
+ testString: assert.strictEqual(largestPrimeFactor(5), 5);
- text: largestPrimeFactor(7) should return 7.
- testString: assert.strictEqual(largestPrimeFactor(7), 7, 'largestPrimeFactor(7) should return 7.');
+ testString: assert.strictEqual(largestPrimeFactor(7), 7);
- text: largestPrimeFactor(13195) should return 29.
- testString: assert.strictEqual(largestPrimeFactor(13195), 29, 'largestPrimeFactor(13195) should return 29.');
+ testString: assert.strictEqual(largestPrimeFactor(13195), 29);
- text: largestPrimeFactor(600851475143) should return 6857.
- testString: assert.strictEqual(largestPrimeFactor(600851475143), 6857, 'largestPrimeFactor(600851475143) should return 6857.');
+ testString: assert.strictEqual(largestPrimeFactor(600851475143), 6857);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-30-digit-n-powers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-30-digit-n-powers.english.md
index 7662a7a7ec..88a5a36f4f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-30-digit-n-powers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-30-digit-n-powers.english.md
@@ -26,13 +26,13 @@ Find the sum of all the numbers that can be written as the sum of n powers of th
```yml
tests:
- text: digitnPowers(2) should return 0.
- testString: assert(digitnPowers(2) == 0, 'digitnPowers(2) should return 0.');
+ testString: assert(digitnPowers(2) == 0);
- text: digitnPowers(3) should return 1301.
- testString: assert(digitnPowers(3) == 1301, 'digitnPowers(3) should return 1301.');
+ testString: assert(digitnPowers(3) == 1301);
- text: digitnPowers(4) should return 19316.
- testString: assert(digitnPowers(4) == 19316, 'digitnPowers(4) should return 19316.');
+ testString: assert(digitnPowers(4) == 19316);
- text: digitnPowers(5) should return 443839.
- testString: assert(digitnPowers(5) == 443839, 'digitnPowers(5) should return 443839.');
+ testString: assert(digitnPowers(5) == 443839);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-300-protein-folding.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-300-protein-folding.english.md
index 7a70b7e6d5..df7e790f9b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-300-protein-folding.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-300-protein-folding.english.md
@@ -37,7 +37,7 @@ Give your answer using as many decimal places as necessary for an exact result.
```yml
tests:
- text: euler300() should return 8.0540771484375.
- testString: assert.strictEqual(euler300(), 8.0540771484375, 'euler300() should return 8.0540771484375.');
+ testString: assert.strictEqual(euler300(), 8.0540771484375);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-301-nim.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-301-nim.english.md
index d68464b3f1..7b1ad02e5e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-301-nim.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-301-nim.english.md
@@ -36,7 +36,7 @@ For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?
```yml
tests:
- text: euler301() should return 2178309.
- testString: assert.strictEqual(euler301(), 2178309, 'euler301() should return 2178309.');
+ testString: assert.strictEqual(euler301(), 2178309);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.english.md
index 5748d43d0d..f4ab7e4a62 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.english.md
@@ -38,7 +38,7 @@ How many Strong Achilles numbers are there below 1018?
```yml
tests:
- text: euler302() should return 1170060.
- testString: assert.strictEqual(euler302(), 1170060, 'euler302() should return 1170060.');
+ testString: assert.strictEqual(euler302(), 1170060);
```