chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md

@@ -1,42 +1,50 @@
 ---
 id: 5900f3711000cf542c50fe84
-title: 问题5：最小的倍数
+title: 'Problem 5: Smallest multiple'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302160
 dashedName: problem-5-smallest-multiple
 ---
 
 # --description--
 
-2520是可以除以1到10中的每个数字而没有任何余数的最小数字。从1到`n`所有数字均可被整除的最小正数是多少？
+2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+
+What is the smallest positive number that is evenly divisible by all of the numbers from 1 to `n`?
 
 # --hints--
 
-`smallestMult(5)`应该返回60。
+`smallestMult(5)` should return a number.
+
+```js
+assert(typeof smallestMult(5) === 'number');
+```
+
+`smallestMult(5)` should return 60.
 
 ```js
 assert.strictEqual(smallestMult(5), 60);
 ```
 
-`smallestMult(7)`应该返回420。
+`smallestMult(7)` should return 420.
 
 ```js
 assert.strictEqual(smallestMult(7), 420);
 ```
 
-`smallestMult(10)`应返回2520。
+`smallestMult(10)` should return 2520.
 
 ```js
 assert.strictEqual(smallestMult(10), 2520);
 ```
 
-`smallestMult(13)`应返回360360。
+`smallestMult(13)` should return 360360.
 
 ```js
 assert.strictEqual(smallestMult(13), 360360);
 ```
 
-`smallestMult(20)`应该返回232792560。
+`smallestMult(20)` should return 232792560.
 
 ```js
 assert.strictEqual(smallestMult(20), 232792560);