chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md

@@ -1,42 +1,50 @@
 ---
 id: 5900f3731000cf542c50fe86
-title: 问题7：10001个素数
+title: 'Problem 7: 10001st prime'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302182
 dashedName: problem-7-10001st-prime
 ---
 
 # --description--
 
-通过列出前六个素数：2,3,5,7,11和13，我们可以看到第6个素数是13.第`n`个素数是多少？
+By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
+
+What is the `n`th prime number?
 
 # --hints--
 
-`nthPrime(6)`应该返回13。
+`nthPrime(6)` should return a number.
+
+```js
+assert(typeof nthPrime(6) === 'number');
+```
+
+`nthPrime(6)` should return 13.
 
 ```js
 assert.strictEqual(nthPrime(6), 13);
 ```
 
-`nthPrime(10)`应该返回29。
+`nthPrime(10)` should return 29.
 
 ```js
 assert.strictEqual(nthPrime(10), 29);
 ```
 
-`nthPrime(100)`应该返回541。
+`nthPrime(100)` should return 541.
 
 ```js
 assert.strictEqual(nthPrime(100), 541);
 ```
 
-`nthPrime(1000)`应该返回7919。
+`nthPrime(1000)` should return 7919.
 
 ```js
 assert.strictEqual(nthPrime(1000), 7919);
 ```
 
-`nthPrime(10001)`应该返回104743。
+`nthPrime(10001)` should return 104743.
 
 ```js
 assert.strictEqual(nthPrime(10001), 104743);