diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-or-5.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-or-5.md index 36c1d47f916..d3d456bc752 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-or-5.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-or-5.md @@ -17,7 +17,7 @@ Find the sum of all the multiples of 3 or 5 below the provided parameter value ` `multiplesOf3Or5(10)` should return a number. ```js -assert(typeof multiplesOf3Or5(10) === 'number'); +assert.isNumber(multiplesOf3Or5(10)); ``` `multiplesOf3Or5(49)` should return 543. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md index 144796de1b0..78794cb0007 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md @@ -17,7 +17,7 @@ Find the sum of all the primes below `n`. `primeSummation(17)` should return a number. ```js -assert(typeof primeSummation(17) === 'number'); +assert.isNumber(primeSummation(17)); ``` `primeSummation(17)` should return 41. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md index 4376672786b..319fe16b9f9 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md @@ -19,7 +19,7 @@ By considering the terms in the Fibonacci sequence whose values do not exceed `n `fiboEvenSum(10)` should return a number. ```js -assert(typeof fiboEvenSum(10) === 'number'); +assert.isNumber(fiboEvenSum(10)); ``` Your function should return an even value. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md index 2961ac6b9c0..e4ba6d47c10 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md @@ -17,7 +17,7 @@ What is the largest prime factor of the given `number`? `largestPrimeFactor(2)` should return a number. ```js -assert(typeof largestPrimeFactor(2) === 'number'); +assert.isNumber(largestPrimeFactor(2)); ``` `largestPrimeFactor(2)` should return 2. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md index 9e436255531..91fd8340e48 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md @@ -17,7 +17,7 @@ Find the largest palindrome made from the product of two `n`-digit numbers. `largestPalindromeProduct(2)` should return a number. ```js -assert(typeof largestPalindromeProduct(2) === 'number'); +assert.isNumber(largestPalindromeProduct(2)); ``` `largestPalindromeProduct(2)` should return 9009. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md index 2f20bceaadf..f89f8366134 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md @@ -17,7 +17,7 @@ What is the smallest positive number that is evenly divisible by all of the numb `smallestMult(5)` should return a number. ```js -assert(typeof smallestMult(5) === 'number'); +assert.isNumber(smallestMult(5)); ``` `smallestMult(5)` should return 60. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md index 65a460bd803..19190c35c46 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md @@ -25,7 +25,7 @@ Find the difference between the sum of the squares of the first `n` natural numb `sumSquareDifference(10)` should return a number. ```js -assert(typeof sumSquareDifference(10) === 'number'); +assert.isNumber(sumSquareDifference(10)); ``` `sumSquareDifference(10)` should return 2640. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md index 6780c8fa2d1..6c148c4231f 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md @@ -17,7 +17,7 @@ What is the `n`th prime number? `nthPrime(6)` should return a number. ```js -assert(typeof nthPrime(6) === 'number'); +assert.isNumber(nthPrime(6)); ``` `nthPrime(6)` should return 13. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md index c84d410e207..9acd529e6e4 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md @@ -38,7 +38,7 @@ Find the `n` adjacent digits in the 1000-digit number that have the greatest pro `largestProductinaSeries(4)` should return a number. ```js -assert(typeof largestProductinaSeries(4) === 'number'); +assert.isNumber(largestProductinaSeries(4)); ``` `largestProductinaSeries(4)` should return 5832. diff --git a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md index c9b196973f9..18262ff7304 100644 --- a/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md +++ b/curriculum/challenges/english/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md @@ -21,7 +21,7 @@ There exists exactly one Pythagorean triplet for which `a` + `b` + `c` = 1000. F `specialPythagoreanTriplet(24)` should return a number. ```js -assert(typeof specialPythagoreanTriplet(24) === 'number'); +assert.isNumber(specialPythagoreanTriplet(24)); ``` `specialPythagoreanTriplet(24)` should return 480. @@ -33,7 +33,7 @@ assert.strictEqual(specialPythagoreanTriplet(24), 480); `specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000. ```js -assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120))); +assert.oneOf(specialPythagoreanTriplet(120), [49920, 55080, 60000]); ``` `specialPythagoreanTriplet(1000)` should return 31875000.