freeCodeCamp/problem-92-square-digit-chains.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3c81000cf542c50fedb	5	Problem 92: Square digit chains

Description

A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before. For example, 44 → 32 → 13 → 10 → 1 → 1 85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89 Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89. How many starting numbers below ten million will arrive at 89?

Instructions

Tests

tests:
  - text: <code>euler92()</code> should return 8581146.
    testString: assert.strictEqual(euler92(), 8581146, '<code>euler92()</code> should return 8581146.');

Challenge Seed

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

euler92();

Solution

// solution required

1.1 KiB Raw Blame History