---
id: 5900f4e81000cf542c50fffa
challengeType: 5
title: 'Problem 379: Least common multiple count'
forumTopicId: 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).
## Instructions
## Tests
```yml
tests:
- text: euler379() should return 132314136838185.
testString: assert.strictEqual(euler379(), 132314136838185);
```
## Challenge Seed
```js
function euler379() {
return true;
}
euler379();
```