2018-10-10 22:03:03 +00:00
---
id: 5900f4cb1000cf542c50ffdd
2021-02-06 04:42:36 +00:00
title: 'Problem 350: Constraining the least greatest and the greatest least'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 302010
2021-01-13 02:31:00 +00:00
dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
A list of size n is a sequence of n natural numbers. Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
The greatest common divisor, or gcd, of a list is the largest natural number that divides all entries of the list. Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
The least common multiple, or lcm, of a list is the smallest natural number divisible by each entry of the list. Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let f(G, L, N) be the number of lists of size N with gcd ≥ G and lcm ≤ L. For example:
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
f(10, 100, 1) = 91. f(10, 100, 2) = 327. f(10, 100, 3) = 1135. f(10, 100, 1000) mod 1014 = 3286053.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Find f(106, 1012, 1018) mod 1014.
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler350()` should return 84664213.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler350(), 84664213);
2018-10-10 22:03:03 +00:00
```
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler350() {
return true;
}
euler350();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2021-01-13 02:31:00 +00:00
```js
// solution required
```