freeCodeCamp/problem-388-distinct-lines.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1018 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4f11000cf542c510002	5	false	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

1018 B Raw Blame History