freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.english.md

id, challengeType, title

id	challengeType	title
5900f4d11000cf542c50ffe4	5	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.

Instructions

Tests

tests:
  - text: <code>euler357()</code> should return 1739023853137.
    testString: assert.strictEqual(euler357(), 1739023853137, '<code>euler357()</code> should return 1739023853137.');

Challenge Seed

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

euler357();

Solution

// solution required