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

953 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f47b1000cf542c50ff8d	5	false	Problem 271: Modular Cubes, part 1	301921

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);

Challenge Seed

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

euler271();

Solution

// solution required

953 B Raw Blame History