chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md

@@ -1,45 +1,53 @@
 ---
 id: 597f24c1dda4e70f53c79c81
-title: 斐波那契序列
+title: Fibonacci sequence
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302268
 dashedName: fibonacci-sequence
 ---
 
 # --description--
 
-<p>编写一个函数来生成第<big>n <sup>个</sup></big> Fibonacci数。 </p> /// <p>第<big>n <sup>个</sup></big> Fibonacci数由下式给出：/// </p><p> F <sub>n</sub> = F <sub>n-1</sub> + F <sub>n-2</sub> </p> /// <p>该系列的前两个术语是0,1。 </p> /// <p>因此，该系列是：0,1,1,2,3,5,8,13 ...... </p> ///
+Write a function to generate the <code>n<sup>th</sup></code> Fibonacci number.
+
+The <code>n<sup>th</sup></code> Fibonacci number is given by:
+
+<code>F<sub>n</sub> = F<sub>n-1</sub> + F<sub>n-2</sub></code>
+
+The first two terms of the series are 0 and 1.
+
+Hence, the series is: 0, 1, 1, 2, 3, 5, 8, 13...
 
 # --hints--
 
-`fibonacci`是一种功能。
+`fibonacci` should be a function.
 
 ```js
 assert(typeof fibonacci === 'function');
 ```
 
-`fibonacci(2)`应该返回一个数字。
+`fibonacci(2)` should return a number.
 
 ```js
 assert(typeof fibonacci(2) == 'number');
 ```
 
-`fibonacci(3)`应该返回1.“）
+`fibonacci(3)` should return 2.
 
 ```js
-assert.equal(fibonacci(3), 1);
+assert.equal(fibonacci(3), 2);
 ```
 
-`fibonacci(5)`应该返回3.“）
+`fibonacci(5)` should return 5.
 
 ```js
-assert.equal(fibonacci(5), 3);
+assert.equal(fibonacci(5), 5);
 ```
 
-`fibonacci(10)`应该返回34.“）
+`fibonacci(10)` should return 55.
 
 ```js
-assert.equal(fibonacci(10), 34);
+assert.equal(fibonacci(10), 55);
 ```
 
 # --seed--