bd68b70f3d
* 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>
63 lines
905 B
Markdown
63 lines
905 B
Markdown
---
|
|
id: 5900f4d11000cf542c50ffe4
|
|
challengeType: 5
|
|
title: 'Problem 357: Prime generating integers'
|
|
forumTopicId: 302017
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
Consider the divisors of 30: 1,2,3,5,6,10,15,30.
|
|
It can be seen that for every divisor d of 30, d+30/d is prime.
|
|
|
|
|
|
Find the sum of all positive integers n not exceeding 100 000 000such that
|
|
for every divisor d of n, d+n/d is prime.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler357()</code> should return 1739023853137.
|
|
testString: assert.strictEqual(euler357(), 1739023853137);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler357() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler357();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|