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

fix(curriculum): clean-up Project Euler 341-360 (#42998)

Browse Source 
* fix: clean-up Project Euler 341-360

* fix: improve wording

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-29 19:14:22 +02:00
committed by GitHub
parent 7e41f19633
commit c18554dd44
20 changed files with 271 additions and 168 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
View File

@ -8,18 +8,18 @@ dashedName: problem-346-strong-repunits
# --description--
The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1.
The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. $7_{10} = {11}_6 = {111}_2$). In other words, 7 is a repunit in at least two bases $b > 1$.
We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1, 7, 13, 15, 21, 31, 40, 43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
Find the sum of all strong repunits below 1012.
Find the sum of all strong repunits below ${10}^{12}$.
# --hints--
`euler346()` should return 336108797689259260.
`strongRepunits()` should return `336108797689259260`.
```js
assert.strictEqual(euler346(), 336108797689259260);
assert.strictEqual(strongRepunits(), 336108797689259260);
```
# --seed--
@ -27,12 +27,12 @@ assert.strictEqual(euler346(), 336108797689259260);
## --seed-contents--
```js
function euler346() {
function strongRepunits() {
return true;
}
euler346();
strongRepunits();
```
# --solutions--