---
id: 5900f3e21000cf542c50fef5
challengeType: 5
title: '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?
## Instructions
## Tests
```yml
tests:
- text: euler118() should return 44680.
testString: assert.strictEqual(euler118(), 44680, 'euler118() should return 44680.');
```
## Challenge Seed
```js
function euler118() {
// Good luck!
return true;
}
euler118();
```