freeCodeCamp/problem-211-divisor-square-sum.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

883 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f43f1000cf542c50ff52	5	false	Problem 211: Divisor Square Sum	301853

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

883 B Raw Blame History Unescape Escape