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

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

1020 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5191000cf542c51002c	5	false	Problem 429: Sum of squares of unitary divisors	302099

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);

Challenge Seed

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

euler429();

Solution

// solution required

1020 B Raw Blame History