ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
41 lines
756 B
Markdown
41 lines
756 B
Markdown
---
|
|
id: 5900f3e21000cf542c50fef5
|
|
title: 'Problem 118: Pandigital prime sets'
|
|
challengeType: 5
|
|
forumTopicId: 301744
|
|
dashedName: problem-118-pandigital-prime-sets
|
|
---
|
|
|
|
# --description--
|
|
|
|
Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,89,631}, all of the elements belonging to it are prime.
|
|
|
|
How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?
|
|
|
|
# --hints--
|
|
|
|
`euler118()` should return 44680.
|
|
|
|
```js
|
|
assert.strictEqual(euler118(), 44680);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler118() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler118();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|