chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md

@@ -1,20 +1,20 @@
 ---
 id: 5900f47e1000cf542c50ff90
-title: 问题273：正方形的总和
+title: 'Problem 273: Sum of Squares'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301923
 dashedName: problem-273-sum-of-squares
 ---
 
 # --description--
 
-考虑以下形式的方程：a2 + b2 = N，0≤a≤b，a，b和N整数。
+Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
 
-对于N = 65，有两种解决方案：a = 1，b = 8，a = 4，b = 7。我们将S（N）称为a2 + b2 = N，0≤a≤b，a，b和N整数的所有解的a的值之和。因此，S（65）= 1 + 4 = 5.找到ΣS（N），对于所有无平均N，只能被4k + 1形式的素数整除，其中4k + 1 <150。
+For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 < 150.
 
 # --hints--
 
-`euler273()`应该返回2032447591196869000。
+`euler273()` should return 2032447591196869000.
 
 ```js
 assert.strictEqual(euler273(), 2032447591196869000);