freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.chinese.md

---
id: 5900f3a01000cf542c50feb3
challengeType: 5
title: 'Problem 52: Permuted multiples'
videoUrl: ''
localeTitle: 问题52：置换倍数
---

## Description
<section id="description">可以看出，数字125874及其双精度数251748包含完全相同的数字，但顺序不同。找到最小的正整数x，使得2x，3x，4x，5x和6x包含相同的数字。 </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>permutedMultiples()</code>应该返回142857。
    testString: assert.strictEqual(permutedMultiples(), 142857);

```

</section>

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

<div id='js-seed'>

```js
function permutedMultiples() {
  // Good luck!
  return true;
}

permutedMultiples();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>