2018-10-10 22:03:03 +00:00
---
id: 5900f45d1000cf542c50ff70
2021-02-06 04:42:36 +00:00
title: 'Problem 241: Perfection Quotients'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301888
2021-01-13 02:31:00 +00:00
dashedName: problem-241-perfection-quotients
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
For a positive integer n, let σ (n) be the sum of all divisors of n, so e.g. σ (6) = 1 + 2 + 3 + 6 = 12.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
A perfect number, as you probably know, is a number with σ (n) = 2n.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let us define the perfection quotient of a positive integer asp(n)= σ (n)n . Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k + 1⁄ 2, where k is an integer.
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
`euler241()` should return 482316491800641150.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler241(), 482316491800641150);
2018-10-10 22:03:03 +00:00
```
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler241() {
return true;
}
euler241();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
```js
// solution required
```