6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.2 KiB
1.2 KiB
id, challengeType, title, forumTopicId
| 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>primePairSets()</code> should return a number.
testString: assert(typeof primePairSets() === 'number');
- text: <code>primePairSets()</code> should return 26033.
testString: assert.strictEqual(primePairSets(), 26033);
Challenge Seed
function primePairSets() {
// Good luck!
return true;
}
primePairSets();
Solution
// solution required