freeCodeCamp/problem-401-sum-of-squares-of-divisors.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

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4fd1000cf542c51000f	5	false	Problem 401: Sum of squares of divisors	302069

Description

The divisors of 6 are 1,2,3 and 6. The sum of the squares of these numbers is 1+4+9+36=50.

Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.

Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.

Find SIGMA2(1015) modulo 109.

Instructions

Tests

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

Challenge Seed

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

euler401();

Solution

// solution required

1.0 KiB Raw Blame History