freeCodeCamp/problem-429-sum-of-squares-of-unitary-divisors.chinese.md at f5eeda68d1dcdee7e0039a575b3d0d669b96199c

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

1000 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f5191000cf542c51002c	5	Problem 429: Sum of squares of unitary divisors		问题429：单一除数的平方和

Description

数为n的unit除数d是n的除数，其性质为gcd（d，n / d）= 1。 4的除数！ = 24是1、3、8和24。它们的平方和是12 + 32 + 82 + 242 = 650。

令S（n）表示n的一元除数的平方和。因此，S（4！）＝ 650。

求S（100000000！）取模1000000009。

Instructions

Tests

tests:
  - text: <code>euler429()</code>应该返回98792821。
    testString: assert.strictEqual(euler429(), 98792821);

Challenge Seed

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

euler429();

Solution

// solution required

1000 B Raw Blame History Unescape Escape