chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md

@@ -1,34 +1,34 @@
 ---
 id: 5900f4301000cf542c50ff42
-title: 问题196：Prime三胞胎
+title: 'Problem 196: Prime triplets'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301834
 dashedName: problem-196-prime-triplets
 ---
 
 # --description--
 
-以下列方式从所有正整数构建三角形：
+Build a triangle from all positive integers in the following way:
 
-1 2 3 4 5 6 7 8 9 1011 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2829 30 31 32 33 34 35 3637 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66。 。 。
+1 2 3 4 5 6 7 8 9 1011 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2829 30 31 32 33 34 35 3637 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 . . .
 
-每个正整数在三角形中最多有八个邻居。
+Each positive integer has up to eight neighbours in the triangle.
 
-如果三个素数中的一个具有另外两个作为三角形中的邻居，则一组三个素数被称为素数三元组。
+A set of three primes is called a prime triplet if one of the three primes has the other two as neighbours in the triangle.
 
-例如，在第二行中，素数2和3是某些素数三元组的元素。
+For example, in the second row, the prime numbers 2 and 3 are elements of some prime triplet.
 
-如果考虑第8行，它包含两个素数，它们是某些素数三元组的元素，即29和31.如果考虑第9行，它只包含一个素数，它是某个素数三元组的元素：37。
+If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31. If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37.
 
-将S（n）定义为行n中素数的总和，它是任何素数三元组的元素。然后S（8）= 60并且S（9）= 37。
+Define S(n) as the sum of the primes in row n which are elements of any prime triplet. Then S(8)=60 and S(9)=37.
 
-你被给予S（10000）= 950007619。
+You are given that S(10000)=950007619.
 
-找到S（5678027）+ S（7208785）。
+Find S(5678027) + S(7208785).
 
 # --hints--
 
-`euler196()`应返回322303240771079940。
+`euler196()` should return 322303240771079940.
 
 ```js
 assert.strictEqual(euler196(), 322303240771079940);