chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md

@@ -1,22 +1,22 @@
 ---
 id: 5900f4291000cf542c50ff3a
-title: 问题187：半致
+title: 'Problem 187: Semiprimes'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301823
 dashedName: problem-187-semiprimes
 ---
 
 # --description--
 
-复合是包含至少两个素因子的数字。例如，15 = 3×5; 9 = 3×3; 12 = 2×2×3。
+A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
 
-在30以下有十种复合材料恰好包含两个，不一定是不同的主要因素：4,6,9,10,14,15,21,22,25,26。
+There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
 
-有多少复合整数，n <108，恰好有两个，不一定是不同的素因子？
+How many composite integers, n < 108, have precisely two, not necessarily distinct, prime factors?
 
 # --hints--
 
-`euler187()`应该返回17427258。
+`euler187()` should return 17427258.
 
 ```js
 assert.strictEqual(euler187(), 17427258);