chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md

@@ -1,22 +1,22 @@
 ---
 id: 5900f4c71000cf542c50ffd8
-title: 问题346：强大的Repunits
+title: 'Problem 346: Strong Repunits'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302005
 dashedName: problem-346-strong-repunits
 ---
 
 # --description--
 
-数字7是特殊的，因为7是用基数2写的111，用基数6写的是11（即710 = 116 = 1112）。换句话说，7是至少两个碱基b> 1的重新排列。
+The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1.
 
-我们将调用一个正整数，该属性是一个强大的repunit。可以证实，在50以下有8个强大的重新命令：{1,7,13,15,21,31,40,43}。此外，1000以下的所有强大的重新命令的总和等于15864。
+We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
 
-找出1012以下所有强大的回购总和。
+Find the sum of all strong repunits below 1012.
 
 # --hints--
 
-`euler346()`应该返回336108797689259260。
+`euler346()` should return 336108797689259260.
 
 ```js
 assert.strictEqual(euler346(), 336108797689259260);