diff --git a/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.chinese.md b/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.chinese.md
index ca143cdf24..278e5b5c36 100644
--- a/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.chinese.md
+++ b/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.chinese.md
@@ -3,11 +3,15 @@ id: 5900f36e1000cf542c50fe81
 challengeType: 5
 title: 'Problem 2: Even Fibonacci Numbers'
 videoUrl: ''
-localeTitle: 问题2：甚至斐波纳契数
+localeTitle: 问题2：斐波那契数列中的偶数
 ---
 
 ## Description
-<section id="description"> Fibonacci序列中的每个新术语都是通过添加前两个术语生成的。从1和2开始，前10个术语将是： <div style="text-align: center;"> 1,2,3,5,8,13,21,34,55,89 ...... </div>通过考虑Fibonacci序列中的值不超过第<code>n</code>项的项，找到偶数项的和。 </section>
+<section id='description'>
+在斐波那契数列中，每一项都是前两项的和（第一项和第二项除外）。如果从1和2开始，前十项是：
+<div style='text-align: center;'>1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</div>
+求出斐波那契数列中值是偶数的项的和，至第<code>n</code>项（包括第<code>n</code>项）为止。
+</section>
 
 ## Instructions
 <section id="instructions">