freeCodeCamp/problem-429-sum-of-squares-of-unitary-divisors.english.md at ce63de866cb47ef13145a9bb0caf8708b669a4e5

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f5191000cf542c51002c	5	Problem 429: Sum of squares of unitary divisors

Description

A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1. The unitary divisors of 4! = 24 are 1, 3, 8 and 24. The sum of their squares is 12 + 32 + 82 + 242 = 650.

Let S(n) represent the sum of the squares of the unitary divisors of n. Thus S(4!)=650.

Find S(100 000 000!) modulo 1 000 000 009.

Instructions

Tests

tests:
  - text: <code>euler429()</code> should return 98792821.
    testString: assert.strictEqual(euler429(), 98792821, '<code>euler429()</code> should return 98792821.');

Challenge Seed

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

euler429();

Solution

// solution required

1.0 KiB Raw Blame History