freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.english.md

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

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).

Instructions

Tests

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

Challenge Seed

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

euler379();

Solution

// solution required