freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-388-distinct-lines.english.md

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f4f11000cf542c510002	5	Problem 388: Distinct Lines	302052

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.

Instructions

Tests

tests:
  - text: <code>euler388()</code> should return 831907372805130000.
    testString: assert.strictEqual(euler388(), 831907372805130000);

Challenge Seed

function euler388() {
  // Good luck!
  return true;
}

euler388();

Solution

// solution required