---
id: 5900f3e21000cf542c50fef5
challengeType: 5
title: 'Problem 118: Pandigital prime sets'
forumTopicId: 301744
---

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

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler118()</code> should return 44680.
    testString: assert.strictEqual(euler118(), 44680);

```

</section>

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

<div id='js-seed'>

```js
function euler118() {

  return true;
}

euler118();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>