1.1 KiB
1.1 KiB
id | challengeType | title |
---|---|---|
5900f45d1000cf542c50ff70 | 5 | Problem 241: Perfection Quotients |
Description
A perfect number, as you probably know, is a number with σ(n) = 2n.
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.
Instructions
Tests
tests:
- text: <code>euler241()</code> should return 482316491800641150.
testString: assert.strictEqual(euler241(), 482316491800641150, '<code>euler241()</code> should return 482316491800641150.');
Challenge Seed
function euler241() {
// Good luck!
return true;
}
euler241();
Solution
// solution required