---
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--

`pandigitalPrimeSets()` should return `44680`.

```js
assert.strictEqual(pandigitalPrimeSets(), 44680);
```

# --seed--

## --seed-contents--

```js
function pandigitalPrimeSets() {

  return true;
}

pandigitalPrimeSets();
```

# --solutions--

```js
// solution required
```