id	title	challengeType	forumTopicId	dashedName
5900f47b1000cf542c50ff8d	Problem 271: Modular Cubes, part 1	5	301921	problem-271-modular-cubes-part-1

--description--

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

For a positive number n, define S(n) as the sum of the integers x, for which 1

When 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).

--hints--

euler271() should return 4617456485273130000.

assert.strictEqual(euler271(), 4617456485273130000);

function euler271() {

  return true;
}

euler271();

// solution required