freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.english.md

id	challengeType	title
5900f43f1000cf542c50ff52	5	Problem 211: Divisor Square Sum

Description

For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example, σ2(10) = 1 + 4 + 25 + 100 = 130. Find the sum of all n, 0 < n < 64,000,000 such that σ2(n) is a perfect square.

Instructions

Tests

tests:
  - text: <code>euler211()</code> should return 1922364685.
    testString: assert.strictEqual(euler211(), 1922364685);

Challenge Seed

function euler211() {
  // Good luck!
  return true;
}

euler211();

Solution

// solution required