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

fix(curriculum): clean-up Project Euler 381-400 (#43024)

Browse Source 
* fix: clean-up Project Euler 381-400

* fix: missing image extension

* fix: missing subscripts

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

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-30 16:59:29 +02:00
committed by GitHub
parent 594adf02c1
commit d269909faa
20 changed files with 279 additions and 180 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
View File

@ -18,20 +18,24 @@ When we truncate the last digit from 20, we get 2, which is also a Harshad numbe
Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
Also:
$\frac{201}{3} = 67$ which is prime.
Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
Find the sum of the strong, right truncatable Harshad primes less than 1014.
Find the sum of the strong, right truncatable Harshad primes less than ${10}^{14}$.
# --hints--
`euler387()` should return 696067597313468.
`harshadNumbers()` should return `696067597313468`.
```js
assert.strictEqual(euler387(), 696067597313468);
assert.strictEqual(harshadNumbers(), 696067597313468);
```
# --seed--
@ -39,12 +43,12 @@ assert.strictEqual(euler387(), 696067597313468);
## --seed-contents--
```js
function euler387() {
function harshadNumbers() {
return true;
}
euler387();
harshadNumbers();
```
# --solutions--