freeCodeCamp/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.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

1013 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4181000cf542c50ff2a	5	false	Problem 171: Finding numbers for which the sum of the squares of the digits is a square	301806

Description

For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g. f(3) = 32 = 9, f(25) = 22 + 52 = 4 + 25 = 29, f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36 Find the last nine digits of the sum of all n, 0 < n < 1020, such that f(n) is a perfect square.

Instructions

Tests

tests:
  - text: <code>euler171()</code> should return 142989277.
    testString: assert.strictEqual(euler171(), 142989277);

Challenge Seed

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

euler171();

Solution

// solution required

1013 B Raw Blame History