gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(learn): correct tests description (#41280)

Browse Source 
Co-authored-by: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>
This commit is contained in:
gikf
2021-03-09 07:18:12 +01:00
committed by GitHub
parent 75ac8e1725
commit 93495ef6db
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
curriculum/challenges/english/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
View File

@ -54,7 +54,7 @@ As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)
# --instructions-- # --instructions--
Using the above method find a factor of <code>2<sup>929</sup>-1</code> (aka M929) Using the above method find a factor of <code>2<sup>p</sup>-1</code>.
# --hints-- # --hints--
@ -70,19 +70,19 @@ assert(typeof check_mersenne === 'function');
assert(typeof check_mersenne(3) == 'string'); assert(typeof check_mersenne(3) == 'string');
``` ```
`check_mersenne(3)` should return "M3 = 2^3-1 is prime". `check_mersenne(3)` should return the string `M3 = 2^3-1 is prime`.
```js ```js
assert.equal(check_mersenne(3), 'M3 = 2^3-1 is prime'); assert.equal(check_mersenne(3), 'M3 = 2^3-1 is prime');
``` ```
`check_mersenne(23)` should return "M23 = 2^23-1 is composite with factor 47". `check_mersenne(23)` should return the string `M23 = 2^23-1 is composite with factor 47`.
```js ```js
assert.equal(check_mersenne(23), 'M23 = 2^23-1 is composite with factor 47'); assert.equal(check_mersenne(23), 'M23 = 2^23-1 is composite with factor 47');
``` ```
`check_mersenne(929)` should return "M929 = 2^929-1 is composite with factor 13007 `check_mersenne(929)` should return the string `M929 = 2^929-1 is composite with factor 13007`.
```js ```js
assert.equal( assert.equal(