chore(i18n,curriculum): update translations (#44272)

curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-407-idempotents.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5041000cf542c510016
-title: 'Problem 407: Idempotents'
+title: 'Problema 407: Idempotentes'
 challengeType: 5
 forumTopicId: 302075
 dashedName: problem-407-idempotents
@@ -8,18 +8,20 @@ dashedName: problem-407-idempotents
 
 # --description--
 
-If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.
+Se calcularmos $a^2\bmod 6$ para $0 ≤ a ≤ 5$, obtemos: 0, 1, 4, 3, 4, 1.
 
-The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a < n such that a2 ≡ a (mod n). So M(6) = 4.
+O maior valor do tipo, tal que $a^2 ≡ a\bmod 6$ é $4$.
 
-Find ∑M(n) for 1 ≤ n ≤ 107.
+Chamaremos $M(n)$ de o maior valor de $a < n$, tal que $a^2 ≡ a (\text{mod } n)$. Assim, $M(6) = 4$.
+
+Encontre $\sum M(n)$ para $1 ≤ n ≤ {10}^7$.
 
 # --hints--
 
-`euler407()` should return 39782849136421.
+`idempotents()` deve retornar `39782849136421`.
 
 ```js
-assert.strictEqual(euler407(), 39782849136421);
+assert.strictEqual(idempotents(), 39782849136421);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler407(), 39782849136421);
 ## --seed-contents--
 
 ```js
-function euler407() {
+function idempotents() {
 
   return true;
 }
 
-euler407();
+idempotents();
 ```
 
 # --solutions--