freeCodeCamp/problem-271-modular-cubes-part-1.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

977 B

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f47b1000cf542c50ff8d	5	Problem 271: Modular Cubes, part 1

Description

For a positive number n, define S(n) as the sum of the integers x, for which 1When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, S(91)=9+16+22+29+53+74+79+81=363.

Find S(13082761331670030).

Instructions

Tests

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

Challenge Seed

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

euler271();

Solution

// solution required

977 B Raw Blame History