Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

1.1 KiB

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f3bc1000cf542c50fecf Problem 80: Square root digital expansion 5 302194 problem-80-square-root-digital-expansion

--description--

It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.

The square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred decimal digits is 475.

For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.

--hints--

sqrtDigitalExpansion() should return a number.

assert(typeof sqrtDigitalExpansion() === 'number');

sqrtDigitalExpansion() should return 40886.

assert.strictEqual(sqrtDigitalExpansion(), 40886);

--seed--

--seed-contents--

function sqrtDigitalExpansion() {

  return true;
}

sqrtDigitalExpansion();

--solutions--

// solution required