---
id: 5900f3e21000cf542c50fef5
title: '问题 118：全数字（Pandigital）素数集'
challengeType: 1
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. 有趣的是，对于集合 $\\{2, 5, 47, 89, 631\\}$，所有属于它的元素都是素数。

How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?

# --hints--

`pandigitalPrimeSets()` 应该返回 `44680`。

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

# --seed--

## --seed-contents--

```js
function pandigitalPrimeSets() {

  return true;
}

pandigitalPrimeSets();
```

# --solutions--

```js
// solution required
```
