freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.english.md
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

1.3 KiB

id, challengeType, isHidden, title, forumTopicId
id challengeType isHidden title forumTopicId
5900f3bc1000cf542c50fecf 5 false Problem 80: Square root digital expansion 302194

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.

Instructions

Tests

tests:
  - text: <code>sqrtDigitalExpansion()</code> should return a number.
    testString: assert(typeof sqrtDigitalExpansion() === 'number');
  - text: <code>sqrtDigitalExpansion()</code> should return 40886.
    testString: assert.strictEqual(sqrtDigitalExpansion(), 40886);

Challenge Seed

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

sqrtDigitalExpansion();

Solution

// solution required