Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

686 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f4d11000cf542c50ffe4 Problem 357: Prime generating integers 5 302017 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+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.

--hints--

euler357() should return 1739023853137.

assert.strictEqual(euler357(), 1739023853137);

--seed--

--seed-contents--

function euler357() {

  return true;
}

euler357();

--solutions--

// solution required