freeCodeCamp

1.0 KiB

Raw Blame History

id	challengeType	title	videoUrl	localeTitle
5900f5231000cf542c510035	5	Problem 439: Sum of sum of divisors		Problema 439: Suma de suma de divisores

Description

Sea d (k) la suma de todos los divisores de k. Definimos la función S (N) = ∑1≤i≤N ∑1≤j≤Nd (i · j). Por ejemplo, S (3) = d (1) + d (2) + d (3) + d (2) + d (4) + d (6) + d (3) + d (6) + d ( 9) = 59.

Se le da a S (103) = 563576517282 y S (105) mod 109 = 215766508. Encuentre S (1011) mod 109.

Instructions

Tests

tests:
  - text: <code>euler439()</code> debe devolver 968697378.
    testString: 'assert.strictEqual(euler439(), 968697378, "<code>euler439()</code> should return 968697378.");'

Challenge Seed

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

euler439();

Solution

// solution required

1.0 KiB Raw Blame History