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

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

## Description
<section id='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.

</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>primePairSets()</code> should return a number.
    testString: assert(typeof primePairSets() === 'number');
  - text: <code>primePairSets()</code> should return 26033.
    testString: assert.strictEqual(primePairSets(), 26033);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function primePairSets() {

  return true;
}

primePairSets();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>