freeCodeCamp/problem-379-least-common-multiple-count.md at 13e7251ed9d1fb914bcc68cc0597e364638488d2

Oliver Eyton-Williams 2b9e38a17b

2020-09-29 22:09:04 +02:00

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f4e81000cf542c50fffa	5	Problem 379: Least common multiple count	302041

Description

Let f(n) be the number of couples (x,y) with x and y positive integers, x ≤ y and the least common multiple of x and y equal to n.

Let g be the summatory function of f, i.e.: g(n) = ∑ f(i) for 1 ≤ i ≤ n.

You are given that g(106) = 37429395.

Find g(1012).

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

function euler379() {

  return true;
}

euler379();

// solution required