Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md
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

65 lines
970 B
Markdown

---
id: 5900f47d1000cf542c50ff8f
challengeType: 5
isHidden: false
title: 'Problem 272: Modular Cubes, part 2'
forumTopicId: 301922
---
## Description
<section id='description'>
For a positive number n, define C(n) as the number of the integers x, for which 1<x<n andx31 mod n.
When 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 n1011 for which C(n)=242.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler272()</code> should return 8495585919506151000.
testString: assert.strictEqual(euler272(), 8495585919506151000);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler272() {
// Good luck!
return true;
}
euler272();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>