freeCodeCamp/problem-272-modular-cubes-part-2.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

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

970 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f47d1000cf542c50ff8f	5	false	Problem 272: Modular Cubes, part 2	301922

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

Challenge Seed

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

euler272();

Solution

// solution required

970 B Raw Blame History