c18554dd44
* fix: clean-up Project Euler 341-360 * fix: improve wording Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
43 lines
794 B
Markdown
43 lines
794 B
Markdown
---
|
|
id: 5900f4d11000cf542c50ffe4
|
|
title: 'Problem 357: Prime generating integers'
|
|
challengeType: 5
|
|
forumTopicId: 302017
|
|
dashedName: problem-357-prime-generating-integers
|
|
---
|
|
|
|
# --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 + \frac{30}{d}$ is prime.
|
|
|
|
Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such that for every divisor $d$ of $n$, $d + \frac{n}{d}$ is prime.
|
|
|
|
# --hints--
|
|
|
|
`primeGeneratingIntegers()` should return `1739023853137`.
|
|
|
|
```js
|
|
assert.strictEqual(primeGeneratingIntegers(), 1739023853137);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function primeGeneratingIntegers() {
|
|
|
|
return true;
|
|
}
|
|
|
|
primeGeneratingIntegers();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|