2018-10-10 18:03:03 -04:00
---
id: 5900f4ef1000cf542c510001
2021-02-06 04:42:36 +00:00
title: 'Problem 386: Maximum length of an antichain'
2018-10-10 18:03:03 -04:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 302050
2021-01-13 03:31:00 +01:00
dashedName: problem-386-maximum-length-of-an-antichain
2018-10-10 18:03:03 -04:00
---
2020-12-16 00:37:30 -07:00
# --description--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Let n be an integer and S(n) be the set of factors of n.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
A subset A of S(n) is called an antichain of S(n) if A contains only one element or if none of the elements of A divides any of the other elements of A.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
For example: S(30) = {1, 2, 3, 5, 6, 10, 15, 30} {2, 5, 6} is not an antichain of S(30). {2, 3, 5} is an antichain of S(30).
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Let N(n) be the maximum length of an antichain of S(n).
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Find ΣN(n) for 1 ≤ n ≤ 108
2018-10-10 18:03:03 -04:00
2020-12-16 00:37:30 -07:00
# --hints--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
`euler386()` should return 528755790.
2018-10-10 18:03:03 -04:00
```js
2020-12-16 00:37:30 -07:00
assert.strictEqual(euler386(), 528755790);
2018-10-10 18:03:03 -04:00
```
2021-01-13 03:31:00 +01:00
# --seed--
## --seed-contents--
```js
function euler386() {
return true;
}
euler386();
```
2020-12-16 00:37:30 -07:00
# --solutions--
2020-08-13 17:24:35 +02:00
2021-01-13 03:31:00 +01:00
```js
// solution required
```