bd68b70f3d
* fix: remove isHidden flag from frontmatter * fix: add isUpcomingChange Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> * feat: hide blocks not challenges Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
67 lines
1002 B
Markdown
67 lines
1002 B
Markdown
---
|
|
id: 5900f4f11000cf542c510002
|
|
challengeType: 5
|
|
title: 'Problem 388: Distinct Lines'
|
|
forumTopicId: 302052
|
|
---
|
|
|
|
## Description
|
|
<section id='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.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler388()</code> should return 831907372805130000.
|
|
testString: assert.strictEqual(euler388(), 831907372805130000);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler388() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler388();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|