freeCodeCamp/problem-271-modular-cubes-part-1.english.md at 5a72d44482b2f3d520ea42753474f7ab017b36a7

Files

Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504 )

* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

2020-09-03 15:07:40 -07:00

937 B

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f47b1000cf542c50ff8d	5	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

937 B Raw Blame History