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

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

## Description
<section id='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).
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler379();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>