chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md

@@ -1,21 +1,37 @@
 ---
 id: 5900f3b91000cf542c50fecc
-title: 问题77：总结
+title: 'Problem 77: Prime summations'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302190
 dashedName: problem-77-prime-summations
 ---
 
 # --description--
 
-可以用五种不同的方式将十个作为素数之和：7 + 3 5 + 5 5 + 3 + 2 3 + 3 + 2 + 2 2 + 2 + 2 + 2 + 2第一个值是多少可以用五千多种不同的方式写成素数之和？
+It is possible to write ten as the sum of primes in exactly five different ways:
+
+<div style='margin-left: 4em;'>
+  7 + 3<br>
+  5 + 5<br>
+  5 + 3 + 2<br>
+  3 + 3 + 2 + 2<br>
+  2 + 2 + 2 + 2 + 2<br>
+</div>
+
+What is the first value which can be written as the sum of primes in over five thousand different ways?
 
 # --hints--
 
-`euler77()`应该返回71。
+`primeSummations()` should return a number.
 
 ```js
-assert.strictEqual(euler77(), 71);
+assert(typeof primeSummations() === 'number');
+```
+
+`primeSummations()` should return 71.
+
+```js
+assert.strictEqual(primeSummations(), 71);
 ```
 
 # --seed--