freeCodeCamp/problem-357-prime-generating-integers.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

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

921 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4d11000cf542c50ffe4	5	false	Problem 357: Prime generating integers	302017

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);

Challenge Seed

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

euler357();

Solution

// solution required

921 B Raw Blame History