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-388-distinct-lines.md
View File

@ -8,20 +8,20 @@ dashedName: problem-388-distinct-lines
# --description--
Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
Consider all lattice points ($a$, $b$, $c$) with $0 ≤ a, b, c ≤ N$.
From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
From the origin $O(0, 0, 0)$ all lines are drawn to the other lattice points. Let $D(N)$ be the number of distinct such lines.
You are given that D(1 000 000) = 831909254469114121.
You are given that $D(1\\,000\\,000) = 831\\,909\\,254\\,469\\,114\\,121$.
Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
Find $D({10}^{10})$. Give as your answer the first nine digits followed by the last nine digits.
# --hints--
`euler388()` should return 831907372805130000.
`distinctLines()` should return `831907372805130000`.
```js
assert.strictEqual(euler388(), 831907372805130000);
assert.strictEqual(distinctLines(), 831907372805130000);
```
# --seed--
@ -29,12 +29,12 @@ assert.strictEqual(euler388(), 831907372805130000);
## --seed-contents--
```js
function euler388() {
function distinctLines() {
return true;
}
euler388();
distinctLines();
```
# --solutions--