freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-60-prime-pair-sets....

1.0 KiB

id challengeType title forumTopicId
5900f3a81000cf542c50febb 5 Problem 60: Prime pair sets 302172

Description

The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.

Instructions

Tests

tests:
  - text: <code>euler60()</code> should return 26033.
    testString: assert.strictEqual(euler60(), 26033);

Challenge Seed

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

euler60();

Solution

// solution required