ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
770 B
Markdown
45 lines
770 B
Markdown
---
|
|
id: 5900f4f11000cf542c510002
|
|
title: 'Problem 388: Distinct Lines'
|
|
challengeType: 5
|
|
forumTopicId: 302052
|
|
dashedName: problem-388-distinct-lines
|
|
---
|
|
|
|
# --description--
|
|
|
|
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.
|
|
|
|
You are given that D(1 000 000) = 831909254469114121.
|
|
|
|
Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
|
|
|
|
# --hints--
|
|
|
|
`euler388()` should return 831907372805130000.
|
|
|
|
```js
|
|
assert.strictEqual(euler388(), 831907372805130000);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler388() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler388();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|