freeCodeCamp/problem-272-modular-cubes-part-2.english.md at 9341aadb5b2421c3c0526ab93c657590218ce20c

Files

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

994 B

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f47d1000cf542c50ff8f	5	Problem 272: Modular Cubes, part 2

Description

For a positive number n, define C(n) as the number 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, C(91)=8.

Find the sum of the positive numbers n≤1011 for which C(n)=242.

Instructions

Tests

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

Challenge Seed

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

euler272();

Solution

// solution required

994 B Raw Blame History