47 lines
958 B
Markdown
47 lines
958 B
Markdown
|
---
|
||
|
|
id: 5900f3a81000cf542c50febb
|
||
|
|
title: 'Problem 60: Prime pair sets'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 302172
|
||
|
|
dashedName: problem-60-prime-pair-sets
|
||
|
|
---
|
||
|
|
|
||
|
|
# --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.
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`primePairSets()` should return a number.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert(typeof primePairSets() === 'number');
|
||
|
|
```
|
||
|
|
|
||
|
|
`primePairSets()` should return 26033.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(primePairSets(), 26033);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function primePairSets() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
primePairSets();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|