freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f45d1000cf542c50ff70	5	Problem 241: Perfection Quotients	301888

Description

For a positive integer n, let σ(n) be the sum of all divisors of n, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.

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);

Challenge Seed

function euler241() {

  return true;
}

euler241();

Solution

// solution required